Sciweavers

4555 search results - page 646 / 911
» Deductive Algorithmic Knowledge
Sort
View
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
15 years 11 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...
INFOCOM
2000
IEEE
15 years 11 months ago
Topology Discovery in Heterogeneous IP Networks
Abstract— Knowledge of the up-to-date physical topology of an IP network is crucial to a number of critical network management tasks, including reactive and proactive resource ma...
Yuri Breitbart, Minos N. Garofalakis, Cliff Martin...
KDD
1999
ACM
128views Data Mining» more  KDD 1999»
15 years 11 months ago
Towards Automated Synthesis of Data Mining Programs
Code synthesis is routinely used in industry to generate GUIs, form lling applications, and database support code and is even used with COBOL. In this paper we consider the questi...
Wray L. Buntine, Bernd Fischer 0002, Thomas Pressb...
GD
1998
Springer
15 years 11 months ago
Drawing Large Graphs with H3Viewer and Site Manager
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...
Tamara Munzner
ICS
2010
Tsinghua U.
15 years 10 months ago
Memory Consistency Conditions for Self-Assembly Programming
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
Aaron Sterling