Sciweavers

583 search results - page 54 / 117
» Efficient algorithms for constructing decision trees with co...
Sort
View
SAC
2006
ACM
14 years 9 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...
DATE
2002
IEEE
74views Hardware» more  DATE 2002»
15 years 2 months ago
Maze Routing with Buffer Insertion under Transition Time Constraints
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
Li-Da Huang, Minghorng Lai, D. F. Wong, Youxin Gao
CORR
2004
Springer
177views Education» more  CORR 2004»
14 years 9 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard
IVA
2010
Springer
14 years 8 months ago
How a Virtual Agent Should Smile? - Morphological and Dynamic Characteristics of Virtual Agent's Smiles
A smile may communicate different meanings depending on subtle characteristics of the facial expression. In this article, we have studied the morphological and dynamic characteris...
Magalie Ochs, Radoslaw Niewiadomski, Catherine Pel...
WWW
2009
ACM
15 years 10 months ago
Automated synthesis of composite services with correctness guarantee
In this paper, we propose a novel approach for composing existing web services to satisfy the correctness constraints to the design, including freeness of deadlock and unspecified...
Ting Deng, Jinpeng Huai, Xianxian Li, Zongxia Du, ...