1884 search results - page 146 / 377 » Simple Algorithm for Simple Timed Games |
119
click to vote
DCG
2008
15 years 2 months ago
2008
Let P be a set of n points in Rd . A subset S of P is called a (k, )-kernel if for every direction, the direction width of S -approximates that of P, when k "outliers" c...
122
click to vote
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when...
172
click to vote
CPM
1998
Springer
15 years 6 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
117
Voted
ECCC
2000
15 years 2 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
135
click to vote
BMCBI
2004
15 years 2 months ago
2004
Background: The general problem of RNA secondary structure prediction under the widely used thermodynamic model is known to be NP-complete when the structures considered include a...