Sciweavers

1672 search results - page 74 / 335
» Tightness problems in the plane
Sort
View
CDC
2008
IEEE
104views Control Systems» more  CDC 2008»
14 years 3 months ago
A structured multiarmed bandit problem and the greedy policy
—We consider a multiarmed bandit problem where the expected reward of each arm is a linear function of an unknown scalar with a prior distribution. The objective is to choose a s...
Adam J. Mersereau, Paat Rusmevichientong, John N. ...
EJC
2008
13 years 9 months ago
On digraph coloring problems and treewidth duality
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
Albert Atserias
IAT
2006
IEEE
14 years 2 months ago
Toward Inductive Logic Programming for Collaborative Problem Solving
In this paper, we tackle learning in distributed systems and the fact that learning does not necessarily involve the participation of agents directly in the inductive process itse...
Jian Huang, Adrian R. Pearce
QSHINE
2005
IEEE
14 years 2 months ago
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
Zhenjiang Li, J. J. Garcia-Luna-Aceves
SIAMDM
2010
119views more  SIAMDM 2010»
13 years 3 months ago
Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem
The firefighter problem is the following discrete-time game on a graph. Initially, a fire starts at a vertex of the graph. In each round, a firefighter protects one vertex not yet ...
Leizhen Cai, Yongxi Cheng, Elad Verbin, Yuan Zhou