Sciweavers

26 search results - page 5 / 6
» Apt-pbo: solving the software dependency problem using pseud...
Sort
View
POPL
2009
ACM
14 years 6 months ago
Modular code generation from synchronous block diagrams: modularity vs. code size
We study modular, automatic code generation from hierarchical block diagrams with synchronous semantics. Such diagrams are the fundamental model behind widespread tools in the emb...
Roberto Lublinerman, Christian Szegedy, Stavros Tr...
CPHYSICS
2006
127views more  CPHYSICS 2006»
13 years 6 months ago
GenAnneal: Genetically modified Simulated Annealing
A modification of the standard Simulated Annealing (SA) algorithm is presented for finding the global minimum of a continuous multidimensional, multimodal function. We report resu...
Ioannis G. Tsoulos, Isaac E. Lagaris
BIRTHDAY
2008
Springer
13 years 8 months ago
SPREADSPACES: Mathematically-Intelligent Graphical Spreadsheets
Abstract. Starting from existing spreadsheet software, like Lotus 1-23R , ExcelR , or Spreadsheet 2000R , we propose a sequence of enhancements to fully integrate constraint-based ...
Nachum Dershowitz, Claude Kirchner
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 6 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
13 years 10 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...