Sciweavers

2864 search results - page 473 / 573
» Constraint Programming in OPL
Sort
View
AUSAI
2005
Springer
14 years 2 months ago
K-Optimal Pattern Discovery: An Efficient and Effective Approach to Exploratory Data Mining
Most data-mining techniques seek a single model that optimizes an objective function with respect to the data. In many real-world applications several models will equally optimize...
Geoffrey I. Webb
WORDS
2003
IEEE
14 years 2 months ago
Foucault's Pendulum in the Distributed Control Lab
The ’Distributed Control Lab’ [6] at Hasso-PlattnerInstitute, University of Potsdam allows experimentation with a variety of physical equipment via the web (intra and internet...
Andreas Rasche, Peter Tröger, Michael Dirska,...
ISPD
2000
ACM
113views Hardware» more  ISPD 2000»
14 years 1 months ago
Floorplan area minimization using Lagrangian relaxation
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
Fung Yu Young, Chris C. N. Chu, W. S. Luk, Y. C. W...
DPC
1996
192views more  DPC 1996»
13 years 10 months ago
Finding Pictures of Objects in Large Collections of Images
Retrieving images from very large collections, using image content as a key, is becoming an important problem. Users prefer to ask for pictures using notions of content that are st...
David A. Forsyth, Jitendra Malik, Thomas K. Leung,...
CP
2008
Springer
13 years 10 months ago
Search Strategies for Rectangle Packing
Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a...
Helmut Simonis, Barry O'Sullivan