吃苹果eating apple problem问题代码
上传时间： 2015-08-21
上传用户：天涯
reader-writer-problem读者写者问题代码
上传时间： 2015-08-21
上传用户：佳期如梦
ACM试题An Easy problem Description As we known, data stored in the computers is in binary form. The problem we discuss now is about the positive integers and its binary form. Given a positive integer I, you task is to find out an integer J, which is the minimum integer greater than I, and the number of 1 s in whose binary form is the same as that in the binary form of I. For example, if "78" is given, we can write out its binary form, "1001110". This binary form has 4 1 s. The minimum integer, which is greater than "1001110" and also contains 4 1 s, is "1010011", i.e. "83", so you should output "83".
标签： Description computers problem binary
上传时间： 2013-12-11
上传用户：libenshu01
ACM试题problem K:Ones Description Given any integer 0 <= n <= 10000 not divisible by 2 or 5, some multiple of n is a number which in decimal notation is a sequence of 1 s. How many digits are in the smallest such a multiple of n?
标签： Description divisible problem integer
上传时间： 2015-08-23
上传用户：zhenyushaw
This a parallel genetic algorithm for a biinfomatics problem CSP
标签： biinfomatics algorithm parallel genetic
上传时间： 2015-08-26
上传用户：x4587
Lamb problem: The analytical solution of vertical point source. This is very important for synthetic modeling
标签： analytical important synthetic solution
上传时间： 2013-12-25
上传用户：hongmo
The problem with the IID_s is solved ! File-Structure: ~~~~~~~~~~~~~~~ DirectDraw.pas = DDraw.h + DVP.h (+ MultiMon.h) Direct3D.pas = D3D.h + D3DTypes.h + D3DCaps.h + D3DVec.inl + DXFile.h Direct3DRM.pas = D3DRM.h + D3DRMDef.h + D3DRMObj.h + D3DRMWin.h + RMXFGUID.h + RMXFTmpl.h DirectInput.pas = DInput.h (+ DinputD.h) DirectPlay.pas = DPlay.h + DPLobby.h DirectSound.pas = DSound.h DirectMusic.pas = DLS1.h + DLS2.h + DMDLS.h + DMError.h + DMKSCtrl.h + DMusicC.h + DMusicF.h + DMusicI.h + DMusBuff.h DirectSetup.pas = DSetup.h No Unit = dxsdk.inc
标签： File-Structure DirectDraw problem solved
上传时间： 2015-09-04
上传用户：kikye
This paper deals with the problem of speech enhancement when a corrupted speech signal with an additive colored noise is the only information available for processing. Kalman filtering is known as an effective speech enhancement technique, in which speech signal is usually modeled as autoregressive (AR) process and represented in the state-space domain.
标签： speech with enhancement corrupted
上传时间： 2015-09-07
上传用户：zhangyi99104144
This paper deals with the problem of speech enhancement when only a corrupted speech signal is available for processing. Kalman filtering is known as an effective speech enhancement technique, in which speech signal is usually modeled as autoregressive (AR) model and represented in the state-space domain.
标签： speech enhancement corrupted problem
上传时间： 2013-12-20
上传用户：569342831
车辆行驶路线优化（Vehicle Routing problem）
标签： Vehicle Routing problem 车辆行驶
上传时间： 2014-10-13
上传用户：561596
