Sciweavers

1142 search results - page 46 / 229
» Approximability of Clausal Constraints
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
On efficient soft-input soft-output encoding of convolutional codes
We study efficient algorithms for soft-input soft-output (SISO) encoding of convolutional codes. While the BCJR algorithm has been suggested for SISO encoding, we show that a for...
Andreas Winkelbauer, Gerald Matz
AAAI
1997
15 years 7 months ago
Effective Redundant Constraints for Online Scheduling
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independentheuristics (e.g., variable ...
Lise Getoor, Greger Ottosson, Markus P. J. Fromher...
COMPSAC
2008
IEEE
16 years 20 days ago
Constraint Reasoning in Path-Oriented Random Testing
Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that activate a single control flow path within an imperative program. T...
Arnaud Gotlieb, Matthieu Petit
HEURISTICS
2006
95views more  HEURISTICS 2006»
15 years 6 months ago
Hard and soft constraints for reasoning about qualitative conditional preferences
Many real life optimization problems are defined in terms of both hard and soft constraints, and qualitative conditional preferences. However, there is as yet no single framework f...
Carmel Domshlak, Steven David Prestwich, Francesca...
ACST
2006
15 years 7 months ago
Experimental study of hybrid-type distributed maximal constraint satisfaction algorithm
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
Masato Noto, Masahito Kurihara