338 search results - page 22 / 68 » On the Complexity of Termination Inference for Processes |
129
click to vote
PPDP
2010
Springer
14 years 11 months ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
127
click to vote
FOCS
1998
IEEE
15 years 5 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
ICIP
2004
IEEE
16 years 2 months ago
2004
IEEE
A fast mode decision method for Intra prediction in H.264 is proposed in this work to reduce the encoder complexity. The proposed algorithm adopts a multi-stage sequential mode de...
123
click to vote
GECCO
2010
Springer
15 years 2 months ago
2010
Springer
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
132
click to vote
SPAA
2009
ACM
15 years 8 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...