Sciweavers

2681 search results - page 152 / 537
» Problem F
Sort
View
ATAL
2006
Springer
14 years 2 months ago
On the complexity of practical ATL model checking
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
Wiebe van der Hoek, Alessio Lomuscio, Michael Wool...
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
14 years 2 months ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Andy Mirzaian
GECCO
2009
Springer
100views Optimization» more  GECCO 2009»
14 years 5 months ago
Partial neighborhoods of elementary landscapes
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
L. Darrell Whitley, Andrew M. Sutton
GECCO
2005
Springer
121views Optimization» more  GECCO 2005»
14 years 3 months ago
An evolutionary algorithm to generate hyper-ellipsoid detectors for negative selection
This paper introduces hyper-ellipsoids as an improvement to hyper-spheres as intrusion detectors in a negative selection problem within an artificial immune system. Since hyper-s...
Joseph M. Shapiro, Gary B. Lamont, Gilbert L. Pete...
SWAT
2004
Springer
136views Algorithms» more  SWAT 2004»
14 years 3 months ago
The Relative Worst Order Ratio Applied to Seat Reservation
The seat reservation problem is the problem of assigning passengers to seats on a train with n seats and k stations enroute in an online manner. The performance of algorithms for t...
Joan Boyar, Paul Medvedev