4639 search results - page 134 / 928 » A General Method for Errors-in-Variables Problems in Compute... |
IPPS
2000
IEEE
14 years 1 months ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
GECCO
2006
Springer
14 years 18 days ago
2006
Springer
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
INFOCOM
1997
IEEE
14 years 1 months ago
1997
IEEE
In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting...
ATAL
2005
Springer
14 years 2 months ago
2005
Springer
This paper introduces a multi-robot cooperation approach to solve the pursuit evasion problem for mobile robots that have omnidirectional vision sensors in unknown environments. T...
EMMCVPR
2003
Springer
14 years 2 months ago
2003
Springer
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Set...