Sciweavers

1683 search results - page 55 / 337
» A Needed Narrowing Strategy
Sort
View
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 8 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
EOR
2008
311views more  EOR 2008»
13 years 8 months ago
Optimal pricing, EOL (end of life) warranty, and spare parts manufacturing strategy amid product transition
We study firm's strategy to determine its product price and warranty period, and plan the spare parts manufacturing so as to maximize its profit and at the same time to fulfi...
Bowon Kim, Sangsun Park
IJRR
2002
175views more  IJRR 2002»
13 years 8 months ago
Navigation Strategies for Exploring Indoor Environments
This paper investigates safe and efficient map-building strategies for a mobile robot with imperfect control and sensing. In the implementation, a robot equipped with a range sens...
Héctor H. González-Baños, Jea...
ADHOC
2010
317views more  ADHOC 2010»
13 years 5 months ago
Simple ant routing algorithm strategies for a (Multipurpose) MANET model
A Mobile Ad-hoc Network has limited and scarce resources and thus routing protocols in such environments must be kept as simple as possible. The Simple Ant Routing Algorithm (SARA...
Fernando Correia, Teresa Vazão
MOBICOM
2000
ACM
14 years 1 months ago
Caching strategies in on-demand routing protocols for wireless ad hoc networks
An on-demand routing protocol for wireless ad hoc networks is one that searches for and attempts to discover a route to some destination node only when a sending node originates a...
Yih-Chun Hu, David B. Johnson