Sciweavers

230 search results - page 26 / 46
» Quantum Search with Variable Times
Sort
View
ICDE
2009
IEEE
115views Database» more  ICDE 2009»
16 years 2 months ago
Efficient Evaluation of Multiple Preference Queries
Consider multiple users searching for a hotel room, based on size, cost, distance to the beach, etc. Users may have variable preferences expressed by different weights on the attri...
Leong Hou U, Nikos Mamoulis, Kyriakos Mouratidis
88
Voted
IROS
2009
IEEE
170views Robotics» more  IROS 2009»
15 years 7 months ago
Optimal trajectory design for parametric excitation walking
— Parametric excitation walking is one of methods that realize a passive dynamic like walking on the level ground. In parametric excitation walking, up-and-down motion of the cen...
Yoshihisa Banno, Yuji Harata, Kouichi Taji, Yoji U...
87
Voted
SAT
2007
Springer
181views Hardware» more  SAT 2007»
15 years 6 months ago
Breaking Symmetries in SAT Matrix Models
Abstract. Symmetry occurs naturally in many computational problems. The use of symmetry breaking techniques for solving search problems reduces the search space and therefore is ex...
Inês Lynce, João P. Marques Silva
115
Voted
JAIR
2011
123views more  JAIR 2011»
14 years 7 months ago
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...
111
Voted
LATA
2010
Springer
15 years 5 months ago
A Randomized Numerical Aligner (rNA)
With the advent of new sequencing technologies able to produce an enormous quantity of short genomic sequences, new tools able to search for them inside a references sequence genom...
Alberto Policriti, Alexandru I. Tomescu, Francesco...