Sciweavers

3136 search results - page 475 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
ATAL
2006
Springer
15 years 10 months ago
Comparing market and token-based coordination
Many coordination algorithms claim to be general, implying that they can be used to coordinate agents in a variety of domains. However, little work has been done to quantitatively...
Yang Xu, Paul Scerri, Katia P. Sycara, Michael Lew...
ECOWS
2004
Springer
15 years 10 months ago
Coupled Signature and Specification Matching for Automatic Service Binding
Abstract. Matching of semantic service descriptions is the key to automatic service discovery and binding. Existing approaches split the matchmaking process in two step: signature ...
Michael Klein, Birgitta König-Ries
COMPGEOM
2000
ACM
15 years 10 months ago
Algebraic methods and arithmetic filtering for exact predicates on circle arcs
The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparis...
Olivier Devillers, Alexandra Fronville, Bernard Mo...
WFLP
2000
Springer
82views Algorithms» more  WFLP 2000»
15 years 10 months ago
Strong and NV-sequentiality of constructor systems
Constructor Systems (CSs) are an important subclass of Term Rewriting Systems (TRSs) which can be used stract model of some programming languages. While normalizing strategies are...
Salvador Lucas
WSC
2007
15 years 8 months ago
Parallel cross-entropy optimization
The Cross-Entropy (CE) method is a modern and effective optimization method well suited to parallel implementations. There is a vast array of problems today, some of which are hig...
Gareth E. Evans, Jonathan M. Keith, Dirk P. Kroese