Sciweavers

675 search results - page 86 / 135
» New reals: Can live with them, can live without them
Sort
View
AAAI
1994
13 years 9 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
BMCBI
2005
104views more  BMCBI 2005»
13 years 7 months ago
Scoring functions for transcription factor binding site prediction
Background: Transcription factor binding site (TFBS) prediction is a difficult problem, which requires a good scoring function to discriminate between real binding sites and backg...
Markus T. Friberg, Peter von Rohr, Gaston H. Gonne...
SIGSOFT
2008
ACM
14 years 8 months ago
Extended exceptions for contingencies and their implications for the engineering process
We observed a general problem of sequential programs, which often results in design and programming errors in industrial software engineering projects, and propose a solution appr...
Thorsten van Ellen, Wilhelm Hasselbring
CCS
2011
ACM
12 years 7 months ago
AmazonIA: when elasticity snaps back
Cloud Computing is an emerging technology promising new business opportunities and easy deployment of web services. Much has been written about the risks and benefits of cloud co...
Sven Bugiel, Stefan Nürnberger, Thomas Pö...
PADS
2005
ACM
14 years 1 months ago
Routing Worm: A Fast, Selective Attack Worm Based on IP Address Information
Most well-known Internet worms, such as Code Red, Slammer, and Blaster, infected vulnerable computers by scanning the entire Internet IPv4 space. In this paper, we present a new s...
Cliff Changchun Zou, Donald F. Towsley, Weibo Gong...