203 search results - page 22 / 41 » On the Average Complexity of Moore's State Minimization Algo... |
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
SRDS
1998
IEEE
13 years 11 months ago
1998
IEEE
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different site...
ICTAI
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
SIGGRAPH
1993
ACM
13 years 11 months ago
1993
ACM
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...