Sciweavers

1095 search results - page 40 / 219
» Preprocessing of Intractable Problems
Sort
View
ATAL
2011
Springer
12 years 9 months ago
Concise characteristic function representations in coalitional games based on agent types
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Thus, coalitional games, including Coalition Structure Generation (CSG), have been ...
Suguru Ueda, Makoto Kitaki, Atsushi Iwasaki, Makot...
INFOCOM
2008
IEEE
14 years 3 months ago
Iso-Contour Queries and Gradient Descent with Guaranteed Delivery in Sensor Networks
—We study the problem of data-driven routing and navigation in a distributed sensor network over a continuous scalar field. Specifically, we address the problem of searching fo...
Rik Sarkar, Xianjin Zhu, Jie Gao, Leonidas J. Guib...
ALGORITHMICA
2004
150views more  ALGORITHMICA 2004»
13 years 8 months ago
Sum Coloring of Bipartite Graphs with Bounded Degree
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
Michal Malafiejski, Krzysztof Giaro, Robert Jancze...
COR
2006
118views more  COR 2006»
13 years 9 months ago
Accelerating column generation for aircraft scheduling using constraint propagation
We discuss how constraint programming can improve the performance of a column generation solution process for the NP-hard Tail Assignment problem in aircraft scheduling. Combining...
Mattias Grönkvist
JUCS
2010
117views more  JUCS 2010»
13 years 7 months ago
NP-completeness and FPT Results for Rectilinear Covering Problems
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
Vladimir Estivill-Castro, Apichat Heednacram, Fran...