Sciweavers

110 search results - page 6 / 22
» Automatic Generator of Minimal Problem Solvers
Sort
View
IUI
2004
ACM
15 years 2 months ago
SUPPLE: automatically generating user interfaces
In order to give people ubiquitous access to software applications, device controllers, and Internet services, it will be necessary to automatically adapt user interfaces to the c...
Krzysztof Gajos, Daniel S. Weld
CEC
2010
IEEE
14 years 9 months ago
Grammatical rules for the automated construction of heuristics
— Developing a problem-domain independent methodology to automatically generate high performing solving strategies for specific problems is one of the challenging trends on hype...
Germán Terrazas, Natalio Krasnogor
ORL
2006
105views more  ORL 2006»
14 years 9 months ago
Inventory placement in acyclic supply chain networks
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
CPAIOR
2010
Springer
14 years 7 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
85
Voted
ANLP
2000
148views more  ANLP 2000»
14 years 10 months ago
Minimizing Word Error Rate in Textual Summaries of Spoken Language
Automatic generation of text summaries for spoken language faces the problem of containing incorrect words and passages due to speech recognition errors. This paper describes comp...
Klaus Zechner, Alex Waibel