Sciweavers

1895 search results - page 374 / 379
» Function learning from interpolation
Sort
View
85
Voted
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
15 years 2 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
PODS
1999
ACM
151views Database» more  PODS 1999»
15 years 1 months ago
Exact and Approximate Aggregation in Constraint Query
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
Michael Benedikt, Leonid Libkin
ICLP
1999
Springer
15 years 1 months ago
Logic Programming in Oz with Mozart
Oz is a multiparadigm language that supports logic programming as one of its major paradigms. A multiparadigm language is designed to support different programming paradigms (log...
Peter Van Roy
GROUP
2007
ACM
15 years 1 months ago
Privacy in the open: how attention mediates awareness and privacy in open-plan offices
The tension between privacy and awareness has been a persistent difficulty in distributed environments that support opportunistic and informal interaction. For example, many aware...
Jeremy P. Birnholtz, Carl Gutwin, Kirstie Hawkey
CGO
2004
IEEE
15 years 1 months ago
A Dynamically Tuned Sorting Library
Empirical search is a strategy used during the installation of library generators such as ATLAS, FFTW, and SPIRAL to identify the algorithm or the version of an algorithm that del...
Xiaoming Li, María Jesús Garzar&aacu...