Sciweavers

5493 search results - page 232 / 1099
» Effectively Polynomial Simulations
Sort
View
GECCO
1999
Springer
142views Optimization» more  GECCO 1999»
15 years 10 months ago
Towards Byte Code Genetic Programming
This paper uses the GP paradigm to evolve linear genotypes (individuals) that consist of Java byte code. Our prototype GP system is implemented in Java using a standard Java devel...
Brad Harvey, James A. Foster, Deborah A. Frincke
CONCUR
2006
Springer
15 years 10 months ago
A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...
Stefan Leue, Alin Stefanescu, Wei Wei
ICPR
2010
IEEE
15 years 10 months ago
Probabilistic Clustering Using the Baum-Eagon Inequality
The paper introduces a framework for clustering data objects in a similarity-based context. The aim is to cluster objects into a given number of classes without imposing a hard pa...
Samuel Rota Bulo', Marcello Pelillo
AAAI
2007
15 years 9 months ago
A Qualitative Approach to Multiple Fault Isolation in Continuous Systems
The multiple fault diagnosis problem is important, since the single fault assumption can lead to incorrect or failed diagnoses when multiple faults occur. It is challenging for co...
Matthew J. Daigle, Xenofon D. Koutsoukos, Gautam B...
ASPDAC
2005
ACM
109views Hardware» more  ASPDAC 2005»
15 years 8 months ago
BDD-based two variable sharing extraction
It has been shown that Binary Decision Diagram (BDD) based logic synthesis enjoys faster runtime than the classic logic synthesis systems based on Sum of Product (SOP) form. Howev...
Dennis Wu, Jianwen Zhu