530 search results - page 97 / 106 » An Algorithm for Approximating the Satisfiability Problem of... |
PASTE
2004
ACM
14 years 1 months ago
2004
ACM
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
VLDB
2001
ACM
14 years 6 days ago
2001
ACM
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
ICNP
1999
IEEE
14 years 2 days ago
1999
IEEE
A number of QoS routing algorithms have been proposed to address the dual objective of selecting feasible paths through the network with enough resources to satisfy a connections&...
SIAMJO
2002
13 years 7 months ago
2002
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
KDD
2003
ACM
14 years 8 months ago
2003
ACM
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...