5473 search results - page 778 / 1095 » On the graph isomorphism problem |
178
Voted
CAP
2010
15 years 1 months ago
2010
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
173
click to vote
AAAI
2012
13 years 9 months ago
2012
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
173
click to vote
SYNASC
2006
IEEE
16 years 20 days 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...
183
click to vote
ICALP
2005
Springer
16 years 5 days ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
187
click to vote
ESA
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...