Sciweavers

14165 search results - page 517 / 2833
» The generalized two-server problem
Sort
View
ICALP
1997
Springer
15 years 11 months ago
The Theory of Vaccines
Despite the major role that modularity occupies in computer science, all the known results on modular analysis only treat particular problems, and there is no general unifying the...
Massimo Marchiori
AAAI
2008
15 years 9 months ago
Relaxed Survey Propagation: A Sum-Product Algorithm for Max-SAT
The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginal...
Hai Leong Chieu, Wee Sun Lee
CEC
2005
IEEE
15 years 9 months ago
XCS with computed prediction in continuous multistep environments
We apply XCS with computed prediction (XCSF) to tackle multistep reinforcement learning problems involving continuous inputs. In essence we use XCSF as a method of generalized rein...
Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wils...
IPL
2008
89views more  IPL 2008»
15 years 7 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
CORR
2007
Springer
129views Education» more  CORR 2007»
15 years 7 months ago
A Rank-Metric Approach to Error Control in Random Network Coding
It is shown that the error control problem in random network coding can be reformulated as a generalized decoding problem for rank-metric codes. This result allows many of the too...
Danilo Silva, Frank R. Kschischang, Ralf Koetter