Sciweavers

98 search results - page 15 / 20
» Complexity of the traveling tournament problem
Sort
View
EDBT
2008
ACM
150views Database» more  EDBT 2008»
14 years 7 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
CHI
1995
ACM
13 years 11 months ago
A Generic Platform for Addressing the Multimodal Challenge
Multimodal interactive systems support multiple interaction techniques such as the synergistic use of speech and direct manipulation. The flexibility they offer results in an incr...
Laurence Nigay, Joëlle Coutaz
FOCS
1999
IEEE
13 years 12 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
MEMOCODE
2006
IEEE
14 years 1 months ago
Latency-insensitive design and central repetitive scheduling
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
Julien Boucaron, Robert de Simone, Jean-Vivien Mil...
EOR
2007
72views more  EOR 2007»
13 years 7 months ago
Placing a finite size facility with a center objective on a rectangular plane with barriers
This paper addresses the finite size 1-center placement problem on a rectangular plane in the presence of barriers. Barriers are regions in which both facility location and trave...
Avijit Sarkar, Rajan Batta, Rakesh Nagi