Sciweavers

1983 search results - page 6 / 397
» Competitive graph searches
Sort
View
JAIR
2010
145views more  JAIR 2010»
13 years 6 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon
FCT
2009
Springer
14 years 7 days ago
1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs
Abstract. In the frequency allocation problem we are given a cellular telephone network whose geographical coverage area is divided into cells where phone calls are serviced by fre...
Rafal Witkowski
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 7 months ago
Mathematical Modeling of Competition in Sponsored Search Market
Sponsored search mechanisms have drawn much attention from both academic community and industry in recent years since the seminal papers of [3] and [4]. However, most of the exist...
Jian Liu, Dah Ming Chiu
SBP
2011
Springer
12 years 10 months ago
Consumer Search, Rationing Rules, and the Consequence for Competition
Abstract. Firms’ conjectures about demand are consequential in oligopoly games. Through agent-based modeling of consumers’ search for products, we can study the rationing of de...
Christopher S. Ruebeck
WEA
2005
Springer
86views Algorithms» more  WEA 2005»
14 years 1 months ago
Optimal Competitive Online Ray Search with an Error-Prone Robot
We consider the problem of finding a door along a wall with a blind robot that neither knows the distance to the door nor the direction towards of the door. This problem can be so...
Thomas Kamphans, Elmar Langetepe