Sciweavers

1456 search results - page 129 / 292
» Two Techniques to Improve Finite Model Search
Sort
View
CP
2007
Springer
14 years 2 months ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
AAAI
2004
13 years 9 months ago
Methods for Boosting Revenue in Combinatorial Auctions
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...
Anton Likhodedov, Tuomas Sandholm
NAACL
2010
13 years 6 months ago
Appropriately Handled Prosodic Breaks Help PCFG Parsing
This paper investigates using prosodic information in the form of ToBI break indexes for parsing spontaneous speech. We revisit two previously studied approaches, one that hurt pa...
Zhongqiang Huang, Mary P. Harper
HICSS
2007
IEEE
115views Biometrics» more  HICSS 2007»
14 years 2 months ago
Information losses within the collaborative integration of different process models - BPML as an XML-based interchange format fo
During the last decades market competition created various constellations of collaborative integration between enterprises: integration of parts of the value chain or integration ...
Johannsen Florian, Susanne Leist, Gregor Zellner
IJAR
2007
96views more  IJAR 2007»
13 years 8 months ago
Complexity measurement of fundamental pseudo-independent models
Pseudo-independent (PI) models are a special class of probabilistic domain model (PDM) where a set of marginally independent domain variables shows collective dependency, a specia...
J. Lee, Y. Xiang