893 search results - page 27 / 179 » P3C: A New Algorithm for the Simple Temporal Problem |
CP
2004
Springer
13 years 11 months ago
2004
Springer
This paper presents a new optimization metaheuristic called ID Walk (Intensification/Diversification Walk) that offers advantages for combining simplicity with effectiveness. In ad...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
![A New Perspective [on] Shape-from-Shading](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "A New Perspective [on] Shape-from-Shading")
Shape-from-Shading (SfS) is a fundamental problem in Computer Vision. The vast majority of research in this field have assumed orthography as its projection model. This paper re-e...
CORR
1998
Springer
13 years 7 months ago
1998
Springer
A new training algorithm is presented for delayed reinforcement learning problems that does not assume the existence of a critic model and employs the polytope optimization algorit...
WSC
2004
13 years 9 months ago
2004
Existing research has defined a new type of simulation time called Approximate Time, where the simulation's knowledge about the values that represent time is uncertain. The a...
CP
2009
Springer
14 years 2 months ago
2009
Springer
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search app...