Sciweavers

3909 search results - page 608 / 782
» Extreme Model Checking
Sort
View
SPIRE
2010
Springer
15 years 4 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
SSS
2010
Springer
139views Control Systems» more  SSS 2010»
15 years 4 months ago
Vulnerability Analysis of High Dimensional Complex Systems
Complex systems experience dramatic changes in behavior and can undergo transitions from functional to dysfunctional states. An unstable system is prone to dysfunctional collective...
Vedant Misra, Dion Harmon, Yaneer Bar-Yam
FSTTCS
2010
Springer
15 years 4 months ago
Combinatorial Problems with Discounted Price Functions in Multi-agent Systems
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...
Gagan Goel, Pushkar Tripathi, Lei Wang
IMCSIT
2010
15 years 4 months ago
A Breast Cancer Classifier based on a Combination of Case-Based Reasoning and Ontology Approach
Breast cancer is the second most common form of cancer amongst females and also the fifth most cause of cancer deaths worldwide. In case of this particular type of malignancy, earl...
Essam AbdRabou, Abdel-Badeeh Salem
NAACL
2010
15 years 4 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad