Sciweavers

189 search results - page 22 / 38
» A generalization of the integer linear infeasibility problem
Sort
View
ECIR
2007
Springer
13 years 9 months ago
A Study of Global Inference Algorithms in Multi-document Summarization
Abstract. In this work we study the theoretical and empirical properties of various global inference algorithms for multi-document summarization. We start by defining a general fr...
Ryan T. McDonald
ATAL
2010
Springer
13 years 8 months ago
The multi variable multi constrained distributed constraint optimization framework
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...
Christopher Portway, Edmund H. Durfee
SIGARCH
2008
94views more  SIGARCH 2008»
13 years 7 months ago
Optimized on-chip pipelining of memory-intensive computations on the cell BE
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
Christoph W. Kessler, Jörg Keller
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
14 years 1 months ago
A NSGA-II, web-enabled, parallel optimization framework for NLP and MINLP
Engineering design increasingly uses computer simulation models coupled with optimization algorithms to find the best design that meets the customer constraints within a time con...
David J. Powell, Joel K. Hollingsworth
JCT
2010
114views more  JCT 2010»
13 years 6 months ago
An almost quadratic bound on vertex Folkman numbers
The vertex Folkman number F(r, n, m), n < m, is the smallest integer t such that there exists a Km-free graph of order t with the property that every r-coloring of its vertices...
Andrzej Dudek, Vojtech Rödl