Sciweavers

2745 search results - page 482 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
EUROCAST
2007
Springer
132views Hardware» more  EUROCAST 2007»
15 years 10 months ago
Using Omnidirectional BTS and Different Evolutionary Approaches to Solve the RND Problem
RND (Radio Network Design) is an important problem in mobile telecommunications (for example in mobile/cellular telephony), being also relevant in the rising area of sensor network...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
15 years 11 months ago
Trajectory Planning using Reachable-State Density Functions
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
Richard Mason, Joel W. Burdick
CP
2001
Springer
15 years 10 months ago
Random 3-SAT and BDDs: The Plot Thickens Further
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
Alfonso San Miguel Aguirre, Moshe Y. Vardi
ESA
2007
Springer
153views Algorithms» more  ESA 2007»
15 years 10 months ago
Tradeoffs and Average-Case Equilibria in Selfish Routing
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
Martin Hoefer, Alexander Souza
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
16 years 7 months ago
DeltaSky: Optimal Maintenance of Skyline Deletions without Exclusive Dominance Region Generation
This paper addresses the problem of efficient maintenance of a materialized skyline view in response to skyline removals. While there has been significant progress on skyline quer...
Ping Wu, Divyakant Agrawal, Ömer Egecioglu, A...