Sciweavers

3381 search results - page 17 / 677
» Extending Dependencies with Conditions
Sort
View
ICDE
2008
IEEE
106views Database» more  ICDE 2008»
15 years 4 months ago
Weighted Boolean conditions for ranking
— Current database systems are tailored to efficiently evaluate Boolean expressions which are typically used as selection conditions to restrict the result set. We propose to ad...
Matthias Beck, Burkhard Freitag
JPDC
2006
187views more  JPDC 2006»
14 years 10 months ago
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
An important problem in wireless ad hoc and sensor networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Prev...
Fei Dai, Jie Wu
SAS
2004
Springer
140views Formal Methods» more  SAS 2004»
15 years 3 months ago
Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
Sumit Gulwani, George C. Necula
GC
2007
Springer
14 years 9 months ago
Subdivision Extendibility
Let H be a multigraph and G a graph containing a subgraph isomorphic to a subdivision of H, with S ⊂ V (G) (the ground set) the image of V (H) under the isomorphism. We consider...
Ronald J. Gould, Thor Whalen
AMC
2006
107views more  AMC 2006»
14 years 10 months ago
Linear bilevel programming with upper level constraints depending on the lower level solution
Focus in the paper is on the definition of linear bilevel programming problems, the existence of optimal solutions and necessary as well as sufficient optimality conditions. In th...
Ayalew Getachew Mersha, Stephan Dempe