Sciweavers

1480 search results - page 129 / 296
» Ants can solve constraint satisfaction problems
Sort
View
JAIR
2008
104views more  JAIR 2008»
15 years 6 months ago
M-DPOP: Faithful Distributed Implementation of Efficient Social Choice Problems
In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agent...
Adrian Petcu, Boi Faltings, David C. Parkes
CPAIOR
2006
Springer
15 years 10 months ago
The Timetable Constrained Distance Minimization Problem
We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be mi...
Rasmus V. Rasmussen, Michael A. Trick
KBSE
1997
IEEE
15 years 10 months ago
Genetic Algorithms for Dynamic Test Data Generation
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...
Christoph C. Michael, Gary McGraw, Michael Schatz,...
ATAL
2008
Springer
15 years 8 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan
PODS
1999
ACM
95views Database» more  PODS 1999»
15 years 10 months ago
Minimal Data Upgrading to Prevent Inference and Association
Despite advances in recent years in the area of mandatory access control in database systems, today's information repositories remain vulnerable to inference and data associa...
Steven Dawson, Sabrina De Capitani di Vimercati, P...