Sciweavers

8838 search results - page 1396 / 1768
» Generalizing Domain Theory
Sort
View
ATAL
2001
Springer
15 years 11 months ago
Dynamic Distributed Resource Allocation: A Distributed Constraint Satisfaction Approach
Abstract. In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as distributed senso...
Pragnesh Jay Modi, Hyuckchul Jung, Milind Tambe, W...
SIGGRAPH
2010
ACM
15 years 11 months ago
Feature-aligned T-meshes
High-order and regularly sampled surface representations are more efficient and compact than general meshes and considerably simplify many geometric modeling and processing algor...
Ashish Myles, Nico Pietroni, Denis Kovacs, Denis Z...
STACS
2001
Springer
15 years 11 months ago
On Presburger Liveness of Discrete Timed Automata
Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on ...
Zhe Dang, Pierluigi San Pietro, Richard A. Kemmere...
167
Voted
IJCNN
2000
IEEE
15 years 11 months ago
Bias Learning, Knowledge Sharing
—Biasing properly the hypothesis space of a learner has been shown to improve generalization performance. Methods for achieving this goal have been proposed, that range from desi...
Joumana Ghosn, Yoshua Bengio
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
15 years 11 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
« Prev « First page 1396 / 1768 Last » Next »