2560 search results - page 168 / 512 » Contributions to zero-sum problems |
159
click to vote
AI
2007
Springer
16 years 4 days ago
2007
Springer
Importance sampling-based algorithms are a popular alternative when Bayesian network models are too large or too complex for exact algorithms. However, importance sampling is sensi...
147
click to vote
CIA
2007
Springer
16 years 3 days ago
2007
Springer
Past years have witnessed a growing interest in automated negotiation as a coordination mechanism for interacting agents. This paper presents a generic, problem- and domain-indepen...
185
click to vote
CP
2007
Springer
16 years 3 days ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
117
click to vote
CPM
2007
Springer
16 years 3 days ago
2007
Springer
We address the problem of sketching the hamming distance of data streams. We present a new notion of sketching technique, Fixable sketches and we show that using such sketch not o...
136
click to vote
DILS
2007
Springer
16 years 3 days ago
2007
Springer
This paper focuses on the problem of bioinformatics service reconciliation in a generic and scalable manner so as to enhance interoperability in a highly evolving field. Using XML...