Sciweavers

1456 search results - page 69 / 292
» Improved Randomized Results for That Interval Selection Prob...
Sort
View
SAT
2010
Springer
172views Hardware» more  SAT 2010»
14 years 9 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
14 years 11 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev
AUSDM
2007
Springer
100views Data Mining» more  AUSDM 2007»
15 years 5 months ago
Predictive Model of Insolvency Risk for Australian Corporations
This paper describes the development of a predictive model for corporate insolvency risk in Australia. The model building methodology is empirical with out-ofsample future year te...
Rohan A. Baxter, Mark Gawler, Russell Ang
PTS
2007
81views Hardware» more  PTS 2007»
15 years 21 days ago
An EFSM-Based Passive Fault Detection Approach
Extended Finite State Machine (EFSM)-based passive fault detection involves modeling the system under test (SUT) as an EFSM M, monitoring the input/output behaviors of the SUT, and...
Hasan Ural, Zhi Xu
CORR
2007
Springer
117views Education» more  CORR 2007»
14 years 11 months ago
Dependable k-coverage algorithms for sensor networks
– Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same ti...
Simon Gyula, Miklós Molnár, Lá...