472 search results - page 84 / 95 » Limiting Negations in Formulas |
PE
2010
Springer
13 years 5 months ago
2010
Springer
In today's Internet, a large part of the traffic is carried using the TCP transport protocol. Characterization of the variations of TCP traffic is thus a major challenge, bot...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
CVPR
2005
IEEE
15 years 20 days ago
2005
IEEE
: In many computer vision classification problems, both the error and time characterizes the quality of a decision. We show that such problems can be formalized in the framework of...
SIGSOFT
2008
ACM
14 years 11 months ago
2008
ACM
Executable models are increasingly being employed by development teams to implement robust software systems. Modern executable models offer powerful composition mechanisms that al...
WWW
2009
ACM
14 years 11 months ago
2009
ACM
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...