Sciweavers

2657 search results - page 490 / 532
» On the complexity of hierarchical problem solving
Sort
View
UIST
1997
ACM
14 years 22 days ago
Interactive Beautification: A Technique for Rapid Geometric Design
We propose interactive beautification, a technique for rapid geometric design, and introduce the technique and its algorithm with a prototype system Pegasus. The motivation is to ...
Takeo Igarashi, Satoshi Matsuoka, Sachiko Kawachiy...
CSCLP
2008
Springer
13 years 11 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
HAPTICS
2008
IEEE
13 years 10 months ago
Haptic Interaction with Soft Tissues Based on State-Space Approximation
The well known property of haptic interaction is the high refresh rate of the haptic loop that is necessary for the stability of the interaction. Therefore, only simple computation...
Igor Peterlík, Ludek Matyska
AI
2008
Springer
13 years 9 months ago
Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm
In the arena of automated negotiations we focus on the principal negotiation protocol in bilateral settings, i.e. the alternatingoffers protocol. In the scientific community it is...
Nicola Gatti, Francesco Di Giunta, Stefano Marino
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 9 months ago
Dependability in Aggregation by Averaging
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...