Sciweavers

2715 search results - page 174 / 543
» Total Generalized Variation
Sort
View
121
Voted
COR
2010
117views more  COR 2010»
15 years 3 months ago
Performance optimization of open zero-buffer multi-server queueing networks
Abstract -- Open zero-buffer multi-server general queueing networks occur throughout a number of physical systems in the semi-process and process industries. In this paper, we eval...
R. Andriansyah, Tom Van Woensel, Frederico R. B. C...
SIAMDM
2008
143views more  SIAMDM 2008»
15 years 3 months ago
Coloring Bull-Free Perfectly Contractile Graphs
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...
Benjamin Lévêque, Frédé...
127
Voted
ML
2002
ACM
121views Machine Learning» more  ML 2002»
15 years 3 months ago
Near-Optimal Reinforcement Learning in Polynomial Time
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...
Michael J. Kearns, Satinder P. Singh
ECSQARU
2009
Springer
15 years 1 months ago
Soft Constraints Processing over Divisible Residuated Lattices
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semanti...
Simone Bova
132
Voted
IJNSEC
2010
66views more  IJNSEC 2010»
14 years 10 months ago
Finding Traitors in Secure Networks Using Byzantine Agreements
Secure networks rely upon players to maintain security and reliability. However not every player can be assumed to have total loyalty and one must use methods to uncover traitors ...
Liam Wagner, Stuart McDonald