Sciweavers

2006 search results - page 346 / 402
» Heuristic Security-Testing Methods
Sort
View
JACM
2002
94views more  JACM 2002»
13 years 9 months ago
The greedy path-merging algorithm for contig scaffolding
Given a collection of contigs and mate-pairs. The Contig Scaffolding Problem is to order and orientate the given contigs in a manner that is consistent with as many mate-pairs as p...
Daniel H. Huson, Knut Reinert, Eugene W. Myers
DATAMINE
1999
81views more  DATAMINE 1999»
13 years 8 months ago
The Role of Occam's Razor in Knowledge Discovery
Many KDD systems incorporate an implicit or explicit preference for simpler models, but this use of "Occam's razor" has been strongly criticized by several authors (...
Pedro Domingos
JSA
1998
72views more  JSA 1998»
13 years 8 months ago
Network conscious design of distributed real-time systems
In this paper, we present a network conscious approach to designing distributed real-time systems. Given a task graph design of the system, the end-to-end constraints on the input...
Jung Woo Park, Young Shin Kim, Seongsoo Hong, Mana...
SP
2002
IEEE
226views Security Privacy» more  SP 2002»
13 years 8 months ago
Dynamic load balancing of SAMR applications on distributed systems
Dynamic load balancing(DLB) for parallel systems has been studied extensively; however, DLB for distributed systems is relatively new. To efficiently utilize computing resources p...
Zhiling Lan, Valerie E. Taylor, Greg Bryan
TCAD
2002
73views more  TCAD 2002»
13 years 8 months ago
System-on-a-chip test scheduling with precedence relationships, preemption, and power constraints
Test scheduling is an important problem in system-on-a-chip (SOC) test automation. Efficient test schedules minimize the overall system test application time, avoid test resource c...
Vikram Iyengar, Krishnendu Chakrabarty