Sciweavers

1480 search results - page 267 / 296
» Ants can solve constraint satisfaction problems
Sort
View
ATAL
2005
Springer
14 years 4 months ago
How local is that optimum? k-optimality for DCOP
In multi-agent systems where sets of joint actions (JAs) are generated, metrics are needed to evaluate these sets and efficiently allocate resources for the many JAs. For the case...
Jonathan P. Pearce, Rajiv T. Maheswaran, Milind Ta...
ECML
2005
Springer
14 years 4 months ago
Annealed Discriminant Analysis
Abstract. Motivated by the analogies to statistical physics, the deterministic annealing (DA) method has successfully been demonstrated in a variety of application. In this paper, ...
Gang Wang, Zhihua Zhang, Frederick H. Lochovsky
AGP
1996
IEEE
14 years 3 months ago
Modular Analysis of Suspension Free cc Programs
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
Enea Zaffanella
COR
2008
99views more  COR 2008»
13 years 11 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi
TRANSCI
2008
108views more  TRANSCI 2008»
13 years 10 months ago
Per-Seat, On-Demand Air Transportation Part II: Parallel Local Search
The availability of relatively cheap small jet aircrafts suggests a new air transportation business: dial-a-flight, an on-demand service in which travelers call a few days in adva...
Daniel G. Espinoza, R. Garcia, Marcos Goycoolea, G...