596 search results - page 113 / 120 » Complexity Analysis by Graph Rewriting |
SYNASC
2006
IEEE
15 years 5 months ago
2006
IEEE
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
123
click to vote
MOBICOM
2010
ACM
14 years 12 months ago
2010
ACM
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
115
Voted
JCB
2006
14 years 11 months ago
2006
Genome-wide microarray designs containing millions to hundreds of millions of probes are available for a variety of mammals, including mouse and human. These genome tiling arrays ...
90
Voted
FGCS
2007
14 years 11 months ago
2007
The computing-intensive data mining for inherently Internet-wide distributed data, referred to as Distributed Data Mining (DDM), calls for the support of a powerful Grid with an e...
101
click to vote
TVCG
2010
14 years 10 months ago
2010
— This paper presents topology-based methods to robustly extract, analyze, and track features defined as subsets of isosurfaces. First, we demonstrate how features identified b...