Sciweavers

666 search results - page 101 / 134
» Domain Name Solution Causes New Problems
Sort
View
172
Voted
AMAI
2000
Springer
15 years 9 months ago
On Solving Boolean Optimization with Satisfiability-Based Algorithms
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
Vasco M. Manquinho, João P. Marques Silva
CODES
2005
IEEE
15 years 11 months ago
Enhancing security through hardware-assisted run-time validation of program data properties
The growing number of information security breaches in electronic and computing systems calls for new design paradigms that consider security as a primary design objective. This i...
Divya Arora, Anand Raghunathan, Srivaths Ravi, Nir...
BMCBI
2007
136views more  BMCBI 2007»
15 years 5 months ago
Reduced modeling of signal transduction - a modular approach
Background: Combinatorial complexity is a challenging problem in detailed and mechanistic mathematical modeling of signal transduction. This subject has been discussed intensively...
Markus Koschorreck, Holger Conzelmann, Sybille Ebe...
145
Voted
SIGSOFT
2008
ACM
16 years 6 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
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 5 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi