Sciweavers

7065 search results - page 1243 / 1413
» Iterative Scheduling Algorithms
Sort
View
ALT
2003
Springer
15 years 8 months ago
Can Learning in the Limit Be Done Efficiently?
Abstract. Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to pot...
Thomas Zeugmann
ICSE
2000
IEEE-ACM
15 years 8 months ago
Generating statechart designs from scenarios
This paper presents an algorithm for automatically generating UML statecharts from a collection of UML sequence diagrams. Computer support for this transition between requirements...
Jon Whittle, Johann Schumann
PPSN
2000
Springer
15 years 8 months ago
A Hybrid GA for the Edge-Biconnectivity Augmentation Problem
In the design of communication networks, robustness against failures in single links or nodes is an important issue. This paper proposes a new approach for the NP-complete edge-bic...
Ivana Ljubic, Günther R. Raidl, Jozef Kratica
CVPR
1997
IEEE
15 years 8 months ago
Empirical Bayesian EM-based Motion Segmentation
A recent trend in motion-based segmentation has been to rely on statistical procedures derived from ExpectationMaximization (EM) principles. EM-based approaches have various attra...
Nuno Vasconcelos, Andrew Lippman
161
Voted
FPGA
1995
ACM
149views FPGA» more  FPGA 1995»
15 years 8 months ago
PathFinder: A Negotiation-based Performance-driven Router for FPGAs
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...
Larry McMurchie, Carl Ebeling
« Prev « First page 1243 / 1413 Last » Next »