681 search results - page 80 / 137 » General Polynomial Time Decomposition Algorithms |
PLANX
2008
15 years 1 months ago
2008
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
116
click to vote
DAM
2008
15 years 15 days ago
2008
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of th...
112
Voted
DAM
2007
15 years 12 days ago
2007
It is shown that the set of hybrid one-dimensional reversible cellular automata (CA) with the periodic boundary condition is a regular set. This has several important consequences...
93
Voted
AAAI
2004
15 years 1 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
102
Voted
IPPS
2006
IEEE
15 years 6 months ago
2006
IEEE
Users and developers of grid applications have access to increasing numbers of resources. While more resources generally mean higher capabilities for an application, they also rai...