Sciweavers

8437 search results - page 637 / 1688
» Preferences over Sets
Sort
View
187
Voted
CP
2005
Springer
16 years 25 days ago
Distributed Constraints for Large-Scale Scheduling Problems
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
Montserrat Abril, Miguel A. Salido, Federico Barbe...
DIGRA
2005
Springer
16 years 25 days ago
Law, order and conflicts of interest in massively multiplayer online games
In huge online games where great numbers of players can be connected at the same time, social interaction is complex and conflicts become part of everyday life. There is a set of ...
Daniel Pargman, Andreas Eriksson
199
Voted
ICLP
2005
Springer
16 years 24 days ago
A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
205
Voted
IPSN
2005
Springer
16 years 24 days ago
Ecolocation: a sequence based technique for RF localization in wireless sensor networks
Abstract— In this paper we present a novel sequence-based RF localization algorithm called Ecolocation. Our algorithm determines the location of unknown nodes by examining the or...
Kiran Yedavalli, Bhaskar Krishnamachari, Sharmila ...
173
Voted
SAT
2004
Springer
95views Hardware» more  SAT 2004»
16 years 19 days ago
Local Search for Very Large SAT Problems
The Walksat local search algorithm has previously been extended to handle quantification over variables. This greatly reduces model sizes, but in order to guide greedy moves the a...
Steven David Prestwich, Colin Quirke