1884 search results - page 102 / 377 » Simple Algorithm for Simple Timed Games |
102
click to vote
ICN
2001
Springer
15 years 4 months ago
2001
Springer
New applications have been introduced to the today’s “best-effort” IP networks having different bandwidth and delay guarantee requirements. The IETF is currently focused on D...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
IBPRIA
2005
Springer
15 years 5 months ago
2005
Springer
This paper presents a method for the detection of multiple concentric circles which is based on the Hough Transform (HT). In order to reduce time and memory space the concentric ci...
FOCI
2007
IEEE
15 years 6 months ago
2007
IEEE
— We present a new representation for individuals in problems that have cyclic permutations as solutions. To demonstrate its usefulness, we analyze a simple randomized local sear...
117
click to vote
MOBIHOC
2000
ACM
15 years 4 months ago
2000
ACM
— This paper presents an alternative simple loop-free bandwidth-efficient distributed routing algorithm for mobile ad hoc networks, denoted as distributed dynamic routing (DDR)....