Sciweavers

14386 search results - page 241 / 2878
» The Chinese Generals Problem
Sort
View
ICAISC
2004
Springer
15 years 10 months ago
On Application of Ant Algorithms to Non-bifurcated Multicommodity Flow Problem
Our discussion in this article centers on the application of ant algorithms to the non-bifurcated multicommodity flow problem. We propose a general framework of ant algorithm that...
Krzysztof Walkowiak
COLT
2003
Springer
15 years 10 months ago
Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
Shie Mannor, John N. Tsitsiklis
ICCAD
1997
IEEE
95views Hardware» more  ICCAD 1997»
15 years 8 months ago
An exact solution to simultaneous technology mapping and linear placement problem
In this paper, we present an optimal algorithm for solving the simultaneous technology mapping and linear placement problem for tree-structured circuits with the objective of mini...
Jinan Lou, Amir H. Salek, Massoud Pedram
VL
1994
IEEE
121views Visual Languages» more  VL 1994»
15 years 8 months ago
Using 3D Tubes to Solve the Intersecting Line Representation Problem
In this paper we discuss 3D rendering as a solution to the line crossing problem associated with using connecting lines for illustrating relations in visual programming. The Bezie...
Lindsey L. Spratt, Allen L. Ambler
STOC
1987
ACM
104views Algorithms» more  STOC 1987»
15 years 8 months ago
The Boolean Formula Value Problem Is in ALOGTIME
The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish ...
Samuel R. Buss