153 search results - page 20 / 31 » An experimental study of greedy routing algorithms |
SAT
2005
Springer
15 years 3 months ago
2005
Springer
We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...
SIGCOMM
2004
ACM
15 years 3 months ago
2004
ACM
The ability to locate network bottlenecks along end-to-end paths on the Internet is of great interest to both network operators and researchers. For example, knowing where bottlen...
103
click to vote
AI
1998
Springer
14 years 9 months ago
1998
Springer
In this paper, we address the tradeo between exploration and exploitation for agents which need to learn more about the structure of their environment in order to perform more e e...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
We study the problem of estimating the epipolar geometry
from apparent contours of smooth curved surfaces
with affine camera models. Since apparent contours are
viewpoint depend...
EDBT
2006
ACM
15 years 9 months ago
2006
ACM
Scientific data in the life sciences is distributed over various independent multi-format databases and is constantly expanding. We discuss a scenario where a life science research...