Sciweavers

1593 search results - page 204 / 319
» A visual programming system for automated problem solving
Sort
View
IPCO
2008
118views Optimization» more  IPCO 2008»
15 years 5 months ago
Constraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
KCAP
2005
ACM
15 years 10 months ago
Knowledge base reuse through constraint relaxation
Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Const...
Tomas Eric Nordlander, Derek H. Sleeman, Ken N. Br...
DSVIS
2008
Springer
15 years 6 months ago
A Middleware for Seamless Use of Multiple Displays
Abstract. Current multi-display environments (MDEs) can be composed of displays with different characteristics (e.g. resolution, size) located in any position and at different angl...
Satoshi Sakurai, Yuichi Itoh, Yoshifumi Kitamura, ...
ECEASST
2008
110views more  ECEASST 2008»
15 years 4 months ago
Independence Analysis of Firing and Rule-based Net Transformations in Reconfigurable Object Nets
: The main idea behind Reconfigurable Object Nets (RONs) is to support the visual specification of controlled rule-based net transformations of place/transition nets (P/T nets). RO...
Enrico Biermann, Tony Modica
LCPC
1997
Springer
15 years 8 months ago
Automatic Data Decomposition for Message-Passing Machines
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
Mirela Damian-Iordache, Sriram V. Pemmaraju