493 search results - page 84 / 99 » Quantum Query Complexity of Some Graph Problems |
SYNASC
2006
IEEE
15 years 3 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...
SAC
2010
ACM
14 years 9 months ago
2010
ACM
Software artifacts usually have static program constraints and these constraints should be satisfied in each reuse. In addition to this, the developers are also required to satisf...
COMBINATORICS
2007
14 years 9 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
158
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper explores an inherent tension in modeling and querying uncertain data: simple, intuitive representations of uncertain data capture many application requirements, but the...
HPDC
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper examines how computation can be mapped across the nodes of a distributed search system to effectively utilize available resources. We specifically address computationa...