42 search results - page 5 / 9 » Bisimulation on Speed: Lower Time Bounds |
149
click to vote
ALMOB
2008
15 years 6 months ago
2008
Background: In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accura...
171
click to vote
COMPGEOM
2009
ACM
16 years 15 days ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
149
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— We introduce a problem in which a service vehicle seeks to defend a deadline (boundary) from dynamically arriving mobile targets. The environment is a rectangle and the...
153
click to vote
ALGORITHMICA
2004
15 years 5 months ago
2004
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
173
click to vote
TVLSI
2002
15 years 5 months ago
2002
The performance of many modern computer and communication systems is dictated by the latency of communication pipelines. At the same time, power/energy consumption is often another...