Sciweavers

16404 search results - page 2466 / 3281
» A set coverage problem
Sort
View
ICLP
2009
Springer
16 years 8 months ago
Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs
We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formula...
Xiaoping Chen, Jianmin Ji, Fangzhen Lin
CP
2009
Springer
16 years 8 months ago
Minimising Decision Tree Size as Combinatorial Optimisation
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
Christian Bessiere, Emmanuel Hebrard, Barry O'Sull...
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 8 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
RECOMB
2009
Springer
16 years 8 months ago
Simultaneous Alignment and Folding of Protein Sequences
Abstract. Accurate comparative analysis tools for low-homology proteins remains a difficult challenge in computational biology, especially sequence alignment and consensus folding ...
Bonnie Berger, Charles W. O'Donnell, Jér&oc...
ESORICS
2009
Springer
16 years 8 months ago
Data Structures with Unpredictable Timing
Abstract. A range of attacks on network components, such as algorithmic denial-of-service attacks and cryptanalysis via timing attacks, are enabled by data structures for which an ...
Darrell Bethea, Michael K. Reiter
« Prev « First page 2466 / 3281 Last » Next »