Sciweavers

41 search results - page 6 / 9
» Heuristic approach to optimize the number of test cases for ...
Sort
View
ICMLA
2007
13 years 8 months ago
Learning bayesian networks consistent with the optimal branching
We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
Alexandra M. Carvalho, Arlindo L. Oliveira
ESWS
2007
Springer
14 years 1 months ago
Scalable Web Service Composition with Partial Matches
We investigate scalable algorithms for automated composition (WSC) of Semantic Web Services. Our notion of WSC is very general: the composition semantics includes background knowl...
Adina Sirbu, Jörg Hoffmann
RTSS
1997
IEEE
13 years 11 months ago
More optimism about real-time distributed commit processing
In [6], we proposed a new commit protocol, OPT, specially designed for use in distributed firm-deadline real-time database systems. OPT allows transactions to “optimistically...
Ramesh Gupta, Jayant R. Haritsa, Krithi Ramamritha...
GECCO
2008
Springer
158views Optimization» more  GECCO 2008»
13 years 8 months ago
Structure and parameter estimation for cell systems biology models
In this work we present a new methodology for structure and parameter estimation in cell systems biology modelling. Our modelling framework is based on P systems, an unconl comput...
Francisco José Romero-Campero, Hongqing Cao...
ISPD
2004
ACM
134views Hardware» more  ISPD 2004»
14 years 24 days ago
Performance-driven register insertion in placement
As the CMOS technology is scaled into the dimension of nanometer, the clock frequencies and die sizes of ICs are shown to be increasing steadily [5]. Today, global wires that requ...
Dennis K. Y. Tong, Evangeline F. Y. Young