Sciweavers

98 search results - page 17 / 20
» Complexity of the traveling tournament problem
Sort
View
TALG
2010
86views more  TALG 2010»
13 years 5 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
SODA
2004
ACM
116views Algorithms» more  SODA 2004»
13 years 9 months ago
Retroactive data structures
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called ret...
Erik D. Demaine, John Iacono, Stefan Langerman
JUCS
2008
196views more  JUCS 2008»
13 years 7 months ago
Information Integration for the Masses
Abstract: Information integration applications combine data from heterogeneous sources to assist the user in solving repetitive data-intensive tasks. Currently, such applications r...
Jim Blythe, Dipsy Kapoor, Craig A. Knoblock, Krist...
ICAI
2004
13 years 9 months ago
An Efficient Heuristic Bundle Search Algorithm for Buyers in Electronic Markets
In the age of electronic commerce, with low-cost information access, it has been recognized that a bundle search in a combinatorial trade is very valuable for buyers. Optimal trav...
Linli He, Thomas R. Ioerger
IUI
2009
ACM
14 years 6 days ago
Automatic design of a control interface for a synthetic face
Getting synthetic faces to display natural facial expressions is essential to enhance the interaction between human users and virtual characters. Yet traditional facial control te...
Nicolas Stoiber, Renaud Séguier, Gaspard Br...