Sciweavers

3250 search results - page 439 / 650
» An Algorithm to Solve a Linear Program
Sort
View
ICDE
2000
IEEE
120views Database» more  ICDE 2000»
16 years 7 months ago
Query Planning with Limited Source Capabilities
In information-integration systems, sources may have diverse and limited query capabilities. In this paper we show that because sources have restrictions on retrieving their infor...
Chen Li, Edward Y. Chang
PLDI
2010
ACM
16 years 3 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger
ACMSE
2006
ACM
16 years 14 days ago
Type inference and informative error reporting for secure information flow
If we classify the variables of a program into various security levels, then a secure information flow analysis aims to verify statically that information in the program can flo...
Zhenyue Deng, Geoffrey Smith
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
15 years 10 months ago
A GP neutral function for the artificial ANT problem
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
Esteban Ricalde, Katya Rodríguez-Váz...
PPDP
2010
Springer
15 years 4 months ago
A declarative approach to robust weighted Max-SAT
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
Miquel Bofill, Dídac Busquets, Mateu Villar...