2354 search results - page 115 / 471 » A Common-Sense Theory of Time |
SIGIR
2012
ACM
11 years 10 months ago
2012
ACM
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
TON
2002
13 years 7 months ago
2002
The min-plus theory of greedy shapers has been developed after Cruz's results on the calculus of network delays. An example of greedy shaper is the buffered leaky bucket cont...
CACM
1998
13 years 8 months ago
1998
The long range goal of the “Virtual Design Team” (VDT) research program is to develop computational tools to analyze decision making and communication behavior and thereby to ...
ALDT
2009
Springer
14 years 2 months ago
2009
Springer
In sports competitions, teams can manipulate the result by, for instance, throwing games. We show that we can decide how to manipulate round robin and cup competitions, two of the ...
ISAAC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...