9325 search results - page 410 / 1865 » The decentralized implementability problem |
155
Voted
INFOCOM
2002
IEEE
15 years 10 months ago
2002
IEEE
A multigigabit IP router may receive several millions packets per second from each input link. For each packet, the router needs to find the longest matching prefix in the forw...
179
click to vote
ISPD
1997
ACM
15 years 9 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
151
Voted
CAV
2009
Springer
15 years 9 months ago
2009
Springer
We consider the decision problem for quantifier-free formulas whose atoms are linear inequalities interpreted over the reals or rationals. This problem may be decided using satisf...
126
click to vote
ARCS
2006
Springer
15 years 8 months ago
2006
Springer
: Given is the following "creature's exploration problem": n creatures are moving around in an unknown environment in order to visit all cells in shortest time. This...
145
click to vote
AMAST
2008
Springer
15 years 7 months ago
2008
Springer
Many complex analysis problems can be most clearly and easily specified as logic rules and queries, where rules specify how given facts can be combined to infer new facts, and quer...