1418 search results - page 281 / 284 » The Dynamic Complexity of Formal Languages |
CCGRID
2005
IEEE
15 years 3 months ago
2005
IEEE
Simple resource specification, resource selection, and effective binding are critical capabilities for Grid middleware. We the Virtual Grid, an abstraction for dynamic grid applic...
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
LPAR
2001
Springer
15 years 1 months ago
2001
Springer
When it comes to building robot controllers, highlevel programming arises as a feasible alternative to planning. The task then is to verify a high-level program by finding a lega...
89
Voted
ALGORITHMICA
2005
14 years 9 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
106
click to vote
KBSE
2010
IEEE
14 years 8 months ago
2010
IEEE
Software testing has been commonly used in assuring the quality of database applications. It is often prohibitively expensive to manually write quality tests for complex database ...