Sciweavers

3110 search results - page 364 / 622
» On the initialization of the DNMF algorithm
Sort
View
AIPS
2008
15 years 9 months ago
Using Constraint Networks on Timelines to Model and Solve Planning and Scheduling Problems
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...
Cédric Pralet, Gérard Verfaillie
LISA
2007
15 years 9 months ago
Network Patterns in Cfengine and Scalable Data Aggregation
Network patterns are based on generic algorithms that execute on tree-based overlays. A set of such patterns has been developed at KTH to support distributed monitoring in network...
Mark Burgess, Matthew Disney, Rolf Stadler
ASPDAC
2005
ACM
92views Hardware» more  ASPDAC 2005»
15 years 8 months ago
Partitioning and placement for buildable QCA circuits
— Quantum-dot Cellular Automata (QCA) is a novel computing mechanism that can represent binary information based on spatial distribution of electron charge configuration in chem...
Ramprasad Ravichandran, Michael T. Niemier, Sung K...
PODC
2010
ACM
15 years 8 months ago
Brief announcement: capacity of byzantine agreement with finite link capacity - complete characterization of four-node networks
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...
Guanfeng Liang, Nitin Vaidya
COORDINATION
2008
Springer
15 years 8 months ago
Session Types for Orchestration Charts
We present a novel approach for the sound orchestration of services. It is based on Orcharts and Typecharts: a service orchestration language and an associated behavioural typing l...
Alessandro Fantechi, Elie Najm