Sciweavers

AAAI
2004
13 years 5 months ago
MAX-2-SAT: How Good Is Tabu Search in the Worst-Case?
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over the local s...
Monaldo Mastrolilli, Luca Maria Gambardella
AAAI
2004
13 years 5 months ago
Task Allocation via Self-Organizing Swarm Coalitions in Distributed Mobile Sensor Network
This paper presents a task allocation scheme via selforganizing swarm coalitions for distributed mobile sensor network coverage. Our approach uses the concepts of ant behavior to ...
Kian Hsiang Low, Wee Kheng Leow, Marcelo H. Ang Jr...
AAAI
2004
13 years 5 months ago
Logic Programs with Abstract Constraint Atoms
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
Victor W. Marek, Miroslaw Truszczynski
AAAI
2004
13 years 5 months ago
Learning and Applying Competitive Strategies
Learning reusable sequences can support the development of expertise in many domains, either by improving decisionmaking quality or decreasing execution speed. This paper introduc...
Esther Lock, Susan L. Epstein
AAAI
2004
13 years 5 months ago
On Odd and Even Cycles in Normal Logic Programs
An odd cycle of a logic program is a simple cycle that has an odd number of negative edges in the dependency graph of the program. Similarly, an even cycle is one that has an even...
Fangzhen Lin, Xishun Zhao
AAAI
2004
13 years 5 months ago
Text Classification by Labeling Words
Traditionally, text classifiers are built from labeled training examples. Labeling is usually done manually by human experts (or the users), which is a labor intensive and time co...
Bing Liu, Xiaoli Li, Wee Sun Lee, Philip S. Yu
AAAI
2004
13 years 5 months ago
Methods for Boosting Revenue in Combinatorial Auctions
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...
Anton Likhodedov, Tuomas Sandholm
AAAI
2004
13 years 5 months ago
An Instance-Based State Representation for Network Repair
We describe a formal framework for diagnosis and repair problems that shares elements of the well known partially observable MDP and cost-sensitive classification models. Our cost...
Michael L. Littman, Nishkam Ravi, Eitan Fenson, Ri...
AAAI
2004
13 years 5 months ago
Learning and Inferring Transportation Routines
This paper introduces a hierarchical Markov model that can learn and infer a user's daily movements through the commue model uses multiple levels of abstraction in order to b...
Lin Liao, Dieter Fox, Henry A. Kautz