Sciweavers

1723 search results - page 295 / 345
» Cycling in linear programming problems
Sort
View
WWW
2009
ACM
15 years 10 months ago
Bid optimization for broad match ad auctions
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...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
ICCAD
2002
IEEE
227views Hardware» more  ICCAD 2002»
15 years 6 months ago
Generic ILP versus specialized 0-1 ILP: an update
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
ICSE
2009
IEEE-ACM
15 years 4 months ago
MINTS: A general framework and tool for supporting test-suite minimization
Regression test suites tend to grow over time as new test cases are added to exercise new functionality or to target newly-discovered faults. When test suites become too large, th...
Hwa-You Hsu, Alessandro Orso
EDBT
2009
ACM
145views Database» more  EDBT 2009»
15 years 1 months ago
An efficient online auditing approach to limit private data disclosure
In a database system, disclosure of confidential private data may occur if users can put together the answers of past queries. Traditional access control mechanisms cannot guard a...
Haibing Lu, Yingjiu Li, Vijayalakshmi Atluri, Jaid...
AI
2010
Springer
14 years 9 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...