1884 search results - page 17 / 377 » Simple Algorithm for Simple Timed Games |
114
Voted
INFOCOM
2002
IEEE
15 years 8 months ago
2002
IEEE
— High-aggregate bandwidth switches are those whose port count multiplied by the operating line rate is very high; for example, a 30 port switch operating at 40 Gbps or a 1000 po...
137
Voted
ICNSC
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— In time varying packet-switched networks, delivering data with high reliability using a limited amount of network resources is highly desirable. To capture the trade-of...
113
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications rangi...
141
Voted
IJRR
2008
15 years 3 months ago
2008
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...
142
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...