418 search results - page 5 / 84 » A relaxation-based algorithm for solving the conditional p-c... |
JCIT
2010
13 years 3 months ago
2010
Sensor deployment is a critical issue, as it affects the cost and detection capabilities of a wireless sensor network. Although many previous efforts have addressed this issue, mo...
AMC
2005
13 years 8 months ago
2005
In this paper, solving a cell formation (CF) problem in dynamic condition is going to be discussed by using some traditional metaheuristic methods such as genetic algorithm (GA), ...
AAAI
1996
13 years 10 months ago
1996
Anytime algorithms offer a tradeoff between solution quality and computation time that has proved useful in applying artificial intelligence techniques to time-critical problems. ...
ENDM
2010
13 years 6 months ago
2010
The Eulerian closed walk problem in a digraph is a well-known polynomial-time solvable problem. In this paper, we show that if we impose the feasible solutions to fulfill some pre...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
Most of the shape from shading (SFS) algorithms have been developed under the simplifying assumptions of a Lambertian surface, an orthographic projection, and a distant light sour...