Sciweavers

6253 search results - page 1148 / 1251
» Use Case Modeling Guidelines
Sort
View
127
Voted
BMCBI
2010
113views more  BMCBI 2010»
15 years 3 months ago
Unifying generative and discriminative learning principles
Background: The recognition of functional binding sites in genomic DNA remains one of the fundamental challenges of genome research. During the last decades, a plethora of differe...
Jens Keilwagen, Jan Grau, Stefan Posch, Marc Stric...
IANDC
2008
114views more  IANDC 2008»
15 years 3 months ago
Generalizing the Paige-Tarjan algorithm by abstract interpretation
act Interpretation Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy The Paige and Tarjan algorithm (PT) for comp...
Francesco Ranzato, Francesco Tapparo
IJFCS
2006
106views more  IJFCS 2006»
15 years 3 months ago
A Timed Failure Equivalence Preserving Abstraction for Parametric Time-interval Automata
ion for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, Graduate School of Information Science...
Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teru...
179
Voted
TVLSI
2008
187views more  TVLSI 2008»
15 years 3 months ago
A Design Flow for Architecture Exploration and Implementation of Partially Reconfigurable Processors
During the last years, the growing application complexity, design, and mask costs have compelled embedded system designers to increasingly consider partially reconfigurable applica...
Kingshuk Karuri, Anupam Chattopadhyay, Xiaolin Che...
142
Voted
MP
2002
143views more  MP 2002»
15 years 3 months ago
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
François Vanderbeck
« Prev « First page 1148 / 1251 Last » Next »