Sciweavers

673 search results - page 110 / 135
» Preference-Based Problem Solving for Constraint Programming
Sort
View
CISS
2007
IEEE
13 years 7 months ago
Robust Routing in Wireless Multi-Hop Networks
This paper introduces a robust approach to stochastic multi-hop routing for wireless networks when the quality of links is modelled through a reliability matrix R. Yielding to the ...
Yuchen Wu, Alejandro Ribeiro, Georgios B. Giannaki...
CEC
2008
IEEE
14 years 2 months ago
A study on constrained MA using GA and SQP: Analytical vs. finite-difference gradients
— Many deterministic algorithms in the context of constrained optimization require the first-order derivatives, or the gradient vectors, of the objective and constraint function...
Stephanus Daniel Handoko, Chee Keong Kwoh, Yew-Soo...
IVA
2010
Springer
13 years 6 months ago
Interactive Motion Modeling and Parameterization by Direct Demonstration
Abstract. While interactive virtual humans are becoming widely used in education, training and therapeutic applications, building animations which are both realistic and parameteri...
Carlo Camporesi, Yazhou Huang, Marcelo Kallmann
ESOP
2007
Springer
14 years 1 months ago
Anti-pattern Matching
Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. In a previous work, we hav...
Claude Kirchner, Radu Kopetz, Pierre-Etienne Morea...
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
11 years 10 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...