Sciweavers

2944 search results - page 393 / 589
» Improving Bound Propagation
Sort
View
CSR
2007
Springer
16 years 22 days ago
Equivalence Problems for Circuits over Sets of Natural Numbers
We investigate the complexity of equivalence problems for {∪, ∩, − , +, ×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...
Christian Glaßer, Katrin Herr, Christian Rei...
FAW
2007
Springer
177views Algorithms» more  FAW 2007»
16 years 22 days ago
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Hannes Moser, Somnath Sikdar
GCC
2007
Springer
16 years 22 days ago
Dynamic Data Replication based on Local Optimization Principle in Data Grid
Efficient data access is one way of improving the performance of the Data Grid. In order to speed up the data access and reduce bandwidth consumption, Data Grid replicates essenti...
Yulai Yuan, Yongwei Wu, Guangwen Yang, Feng Yu
HM
2007
Springer
120views Optimization» more  HM 2007»
16 years 22 days ago
On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case
Sudoku is a notorious logic-based puzzle that is popular with puzzle enthusiasts the world over. From a computational perspective, Sudoku is also a problem that belongs to the set ...
Rhydian Lewis
JSAI
2007
Springer
16 years 21 days ago
Towards Translation of Legal Sentences into Logical Forms
This paper reports our ongoing research effort to develop a system which translates legal texts into logical forms in which we can check for inconsistency. Our logical formalizati...
Makoto Nakamura, Shunsuke Nobuoka, Akira Shimazu