Sciweavers

721 search results - page 130 / 145
» GRASP - evolution for constraint satisfaction problems
Sort
View
EDOC
2007
IEEE
15 years 8 months ago
Automated Model-Based Configuration of Enterprise Java Applications
The decentralized process of configuring enterprise applications is complex and error-prone, involving multiple participants/roles and numerous configuration changes across multipl...
Jules White, Douglas C. Schmidt, Krzysztof Czarnec...
AAAI
2007
15 years 6 months ago
Nonmyopic Informative Path Planning in Spatio-Temporal Models
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
Alexandra Meliou, Andreas Krause, Carlos Guestrin,...
EOR
2010
119views more  EOR 2010»
15 years 4 months ago
Adaptive Tabu Search for course timetabling
This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a problem of curriculum-based course timetabling. The proposed algorithm follows a general frame...
Zhipeng Lü, Jin-Kao Hao
ATAL
2003
Springer
15 years 9 months ago
Cooperative negotiation for soft real-time distributed resource allocation
In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic envir...
Roger Mailler, Victor R. Lesser, Bryan Horling
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 4 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur