614 search results - page 75 / 123 » Local Computation: Lower and Upper Bounds |
SIGECOM
2005
ACM
15 years 3 months ago
2005
ACM
We present the first design for a fully expressive iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language that is concise and expressive ...
ISTCS
1993
Springer
15 years 2 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
DAC
2006
ACM
15 years 1 months ago
2006
ACM
Statistical static timing analysis (SSTA) has been a popular research topic in recent years. A fundamental issue with applying SSTA in practice today is the lack of reliable and e...
JMLR
2006
14 years 10 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
100
click to vote
CDC
2010
IEEE
14 years 1 months ago
2010
IEEE
— We propose and analyze the Persistent Patrol Problem (PPP). An unmanned aerial vehicle (UAV) moving with constant speed and unbounded acceleration patrols a bounded region of t...