Sciweavers

6598 search results - page 1064 / 1320
» Graph Theory with Applications
Sort
View
169
Voted
IJRR
2010
115views more  IJRR 2010»
15 years 3 months ago
Improving the Efficiency of Clearing with Multi-agent Teams
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
Geoffrey Hollinger, Sanjiv Singh, Athanasios Kehag...
INFORMS
2010
147views more  INFORMS 2010»
15 years 3 months ago
Exact Algorithms for the Quadratic Linear Ordering Problem
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng
COLOGNETWENTE
2010
15 years 3 months ago
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
Stefano Gualandi, Francesco Maffioli, Claudio Magn...
CI
2011
110views more  CI 2011»
15 years 1 months ago
Experiences with planning for natural language generation
We investigate the application of modern planning techniques to domains arising from problems in natural language generation (NLG). In particular, we consider two novel NLGinspire...
Alexander Koller, Ronald P. A. Petrick
CORR
2011
Springer
181views Education» more  CORR 2011»
15 years 1 months ago
Compressed String Dictionaries
The problem of storing a set of strings – a string dictionary – in compact form appears naturally in many cases. While classically it has represented a small part of the whole ...
Nieves R. Brisaboa, Rodrigo Cánovas, Miguel...
« Prev « First page 1064 / 1320 Last » Next »