Sciweavers

996 search results - page 103 / 200
» A general method to speed up fixed-parameter-tractable algor...
Sort
View
EMO
2006
Springer
219views Optimization» more  EMO 2006»
15 years 8 months ago
ParadisEO-MOEO: A Framework for Evolutionary Multi-objective Optimization
Abstract. This paper presents ParadisEO-MOEO, a white-box objectoriented generic framework dedicated to the flexible design of evolutionary multi-objective algorithms. This paradig...
Arnaud Liefooghe, Matthieu Basseur, Laetitia Jourd...
JAIR
2006
160views more  JAIR 2006»
15 years 4 months ago
Anytime Point-Based Approximations for Large POMDPs
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
ISAAC
2010
Springer
308views Algorithms» more  ISAAC 2010»
15 years 2 months ago
Levelwise Mesh Sparsification for Shortest Path Queries
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo
ARITH
2007
IEEE
15 years 11 months ago
Modular Multiplication using Redundant Digit Division
Most implementations of the modular exponentiation, ME mod N, computation in cryptographic algorithms employ Montgomery multiplication, ABR−1 mod N, instead of modular multiplic...
Ping Tak Peter Tang
SIGECOM
2003
ACM
107views ECommerce» more  SIGECOM 2003»
15 years 10 months ago
Using value queries in combinatorial auctions
Combinatorial auctions, where bidders can bid on bundles of items are known to be desirable auction mechanisms for selling items that are complementary and/or substitutable. Howev...
Benoît Hudson, Tuomas Sandholm