1581 search results - page 188 / 317 » Domain semantics of possibility computations |
101
Voted
BTW
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Clustering has become an increasingly important task in modern application domains. In many areas, e.g. when clustering complex objects, in distributed clustering, or whe...
156
click to vote
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
71
Voted
SIGGRAPH
2010
ACM
15 years 5 months ago
2010
ACM
We propose a finite element simulation method that addresses the full range of material behavior, from purely elastic to highly plastic, for physical domains that are substantial...
96
Voted
HYBRID
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In this paper we propose a trajectory based reachability analysis by using local finite-time invariance property. Trajectory based analysis are based on the execution tra...
100
Voted
COST
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Being aware of the gap between technological offers and user expectations, the paper aims to illustrate the necessity of anthropocentric designs ("user-pulled")...