Sciweavers

4451 search results - page 768 / 891
» On Random Ordering Constraints
Sort
View
HAPTICS
2008
IEEE
13 years 9 months ago
Efficient Transport Protocol for Networked Haptics Applications
The performance of haptic application is highly sensitive to communication delays and losses of data. It implies several constraints in developing networked haptic applications. Th...
Raul Wirz, Manuel Ferre, Raúl Marín,...
ACTA
2010
191views more  ACTA 2010»
13 years 9 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar
AI
2008
Springer
13 years 9 months ago
Label ranking by learning pairwise preferences
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
Eyke Hüllermeier, Johannes Fürnkranz, We...
ANOR
2010
123views more  ANOR 2010»
13 years 9 months ago
Nature inspired genetic algorithms for hard packing problems
This paper presents two novel genetic algorithms (GAs) for hard industrially relevant packing problems. The design of both algorithms is inspired by aspects of molecular genetics,...
Philipp Rohlfshagen, John A. Bullinaria
AR
2007
111views more  AR 2007»
13 years 9 months ago
Acquisition of joint attention through natural interaction utilizing motion cues
Joint attention is one of the most important cognitive functions for the emergence of communication not only between humans but also between humans and robots. In the previous wor...
Hidenobu Sumioka, Koh Hosoda, Yuichiro Yoshikawa, ...