666 search results - page 101 / 134 » Domain Name Solution Causes New Problems |
AMAI
2000
Springer
13 years 11 months ago
2000
Springer
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...
CODES
2005
IEEE
14 years 1 months ago
2005
IEEE
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...
BMCBI
2007
13 years 7 months ago
2007
Background: Combinatorial complexity is a challenging problem in detailed and mechanistic mathematical modeling of signal transduction. This subject has been discussed intensively...
SIGSOFT
2008
ACM
14 years 8 months ago
2008
ACM
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...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
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...