1480 search results - page 265 / 296 » Ants can solve constraint satisfaction problems |
SIGECOM
2005
ACM
14 years 4 months ago
2005
ACM
Bids submitted in auctions are usually treated as enforceable commitments in most bidding and auction theory literature. In reality bidders often withdraw winning bids before the ...
ATAL
2009
Springer
14 years 5 months ago
2009
Springer
Distributed Constraint Optimization (DCOP) is useful for solving agent-coordination problems. Any-space DCOP search algorithms require only a small amount of memory but can be spe...
AIPS
2006
14 years 11 days ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
ATAL
2010
Springer
14 years 2 days ago
2010
Springer
Recent studies have investigated how a team of mobile sensors can cope with real world constraints, such as uncertainty in the reward functions, dynamically appearing and disappea...
Publication
We propose to combine a triangular element surface model with a linearized reflectance map to formulate the shape-from-shading problem. The main idea is to approximate a smooth sur...