3415 search results - page 244 / 683 » Lower bounds on kernelization |
159
click to vote
GLOBECOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—In many wireless ad-hoc networks it is important to find a route that delivers a message to the destination within a certain deadline (delay constraint). We propose to identify...
165
click to vote
WDAG
2007
Springer
16 years 23 days ago
2007
Springer
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
205
click to vote
ANSS
1991
IEEE
15 years 10 months ago
1991
IEEE
The notions of the critical path of events and critical time of an event are key concepts in analyzing the performance of a parallel discrete event simulation. The highest critica...
229
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
We study the problem of navigating through a database of similar objects using comparisons. This problem is known to be strongly related to the small-world network design problem....
173
click to vote
ICALP
2007
Springer
16 years 25 days ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...