Sciweavers

4480 search results - page 47 / 896
» Prototyping Completion with Constraints Using Computational ...
Sort
View
MEMBRANE
2005
Springer
15 years 9 months ago
P Systems, Petri Nets, and Program Machines
Some features capturing the computational completeness of P systems with maximal parallelism, priorities or zero-test using symbol objects are studied through Petri nets. The obtai...
Pierluigi Frisco
131
Voted
JPDC
2000
106views more  JPDC 2000»
15 years 3 months ago
Dual of a Complete Graph as an Interconnection Network
A new class of interconnection networks, the hypernetworks, has been proposed recently. Hypernetworks are characterized by hypergraphs. Compared with point-to-point networks, they...
Si-Qing Zheng, Jie Wu
PODC
2010
ACM
15 years 5 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
CP
1999
Springer
15 years 7 months ago
Search Procedures and Parallelism in Constraint Programming
Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we...
Laurent Perron
EPS
1995
Springer
15 years 7 months ago
A Survey of Constraint Handling Techniques in Evolutionary Computation Methods
One of the major components of any evolutionary system is the evaluation function. Evaluation functions are used to assign a quality measure for individuals in a population. Where...
Zbigniew Michalewicz