Sciweavers

7519 search results - page 463 / 1504
» Optimizing Generic Functions
Sort
View
185
Voted
AI
2004
Springer
16 years 8 days ago
Constraint Satisfaction Methods for Information Personalization
Constraints formalize the dependencies in a physical world in terms of a logical relation among several unknowns. Constraint satisfaction methods allow efficient navigation of larg...
Syed Sibte Raza Abidi, Yong Han Chong
187
Voted
CP
2004
Springer
16 years 8 days ago
Constraint-Based Combinators for Local Search
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
Pascal Van Hentenryck, Laurent Michel, Liyuan Liu
ECAI
2004
Springer
16 years 8 days ago
Avatars That Learn How to Behave
It is possible to model avatars that learn to simulate object manipulations and other complex actions. A number of applications may benefit from this technique including safety, e...
Adam Szarowicz, Paolo Remagnino
155
Voted
MIDDLEWARE
2004
Springer
16 years 7 days ago
Exploring adaptability of secure group communication using formal prototyping techniques
Traditionally, adaptability in communication frameworks has been restricted to predefined choices without taking into consideration tradeoffs between them and the application req...
Sebastian Gutierrez-Nolasco, Nalini Venkatasubrama...
198
Voted
WLP
2004
Springer
16 years 6 days ago
Effective Modeling with Constraints
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
Roman Barták