Sciweavers

1071 search results - page 23 / 215
» Solving Geometric Constraint Systems
Sort
View
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
15 years 11 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
NORDICHI
2004
ACM
15 years 3 months ago
Wolves, football, and ambient computing: facilitating collaboration in problem solving systems through the study of human and an
This paper describes how computer-human interaction in ambient computing environments can be best informed by conceptualizing of such environments as problem solving systems. Typi...
David W. Eccles, Paul T. Groth
E4MAS
2005
Springer
15 years 3 months ago
An Environment-Based Methodology to Design Reactive Multi-agent Systems for Problem Solving
Abstract. Even if the multi-agent paradigm has been evolving for fifteen years, the development of concrete methods for problem solving remains a major challenge. This paper focus...
Olivier Simonin, Franck Gechter
67
Voted
ISPD
1999
ACM
83views Hardware» more  ISPD 1999»
15 years 2 months ago
Efficient solution of systems of orientation constraints
One subtask in constraint-driven placement is enforcing a set of orientation constraints on the devices being placed. Such constraints are created in order to, for example, implem...
Joseph L. Ganley
104
Voted
AISC
2004
Springer
15 years 3 months ago
Combination of Nonlinear Terms in Interval Constraint Satisfaction Techniques
Nonlinear constraint systems can be solved by combining consistency techniques and search. In this approach, the search space is reduced using local reasoning on constraints. Howev...
Laurent Granvilliers, Mina Ouabiba