Sciweavers

4378 search results - page 686 / 876
» On the Complexity of Ordered Colourings
Sort
View
CPAIOR
2010
Springer
15 years 4 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
ECBS
2010
IEEE
200views Hardware» more  ECBS 2010»
15 years 4 months ago
Improving Testing of Enterprise Systems by Model-Based Testing on Graphical User Interfaces
Software development and testing of Enterprise Resource Planning (ERP) systems demands dedicated methods to tackle its special features. As manual testing is not able to systematic...
Sebastian Wieczorek, Alin Stefanescu
EMNLP
2010
15 years 4 months ago
Assessing Phrase-Based Translation Models with Oracle Decoding
Extant Statistical Machine Translation (SMT) systems are very complex softwares, which embed multiple layers of heuristics and embark very large numbers of numerical parameters. A...
Guillaume Wisniewski, Alexandre Allauzen, Fran&cce...
GI
2010
Springer
15 years 4 months ago
Cloud Computing for Autonomous Control in Logistics
Abstract: Logistics processes in a globalised economy are increasingly complex, dynamic, and distributed. These properties pose major challenges for logistics planning and control....
Arne Schuldt, Karl Hribernik, Jan D. Gehrke, Klaus...
GLOBECOM
2010
IEEE
15 years 4 months ago
An Exit-Chart Aided Design Procedure for Near-Capacity N-Component Parallel Concatenated Codes
1 Shannon's channel capacity specifies the upper bound on the amount of bits per channel use. In this paper, we explicitly demonstrate that twin-component turbo codes suffer f...
Hong Chen, Robert G. Maunder, Lajos Hanzo