Sciweavers

5030 search results - page 611 / 1006
» cases 2007
Sort
View
ACTA
2000
92views more  ACTA 2000»
15 years 7 months ago
How to Calculate Symmetries of Petri Nets
Symmetric net structure yields symmetric net behaviour. Thus, knowing the symmetries of a net, redundant calculations can be skipped. We present a framework for the calculation of ...
Karsten Schmidt 0004
AIEDAM
2000
134views more  AIEDAM 2000»
15 years 7 months ago
Adaptive enlargement of state spaces in evolutionary designing
In designing a state space of possible designs is implied by the representation used and the computational processes that operate on that representation. GAs are a means of effect...
John S. Gero, Vladimir A. Kazakov
AIL
2000
78views more  AIL 2000»
15 years 7 months ago
Representation of formal dispute with a standing order
Computational dialectics is a relatively new field. It is, among others, concerned with the formal representation of argument and dispute. The goal is to suggest algorithms, proce...
Gerard Vreeswijk
ALGORITHMICA
2000
80views more  ALGORITHMICA 2000»
15 years 7 months ago
Geometric Eccentricity and the Complexity of Manipulation Plans
Complexity bounds for algorithms for robotic motion and manipulation can be misleading when they are constructed with pathological `worst-case' scenarios that rarely appear i...
A. Frank van der Stappen, Kenneth Y. Goldberg
BIOINFORMATICS
2002
100views more  BIOINFORMATICS 2002»
15 years 7 months ago
Optimal algorithms for local vertex quartet cleaning
Reconstructing evolutionary trees is an important problem in biology. A response to the computational intractability of most of the traditional criteria for inferring evolutionary...
Gianluca Della Vedova, Todd Wareham