Sciweavers

1826 search results - page 301 / 366
» Using Random Forests in the Structured Language Model
Sort
View
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
15 years 3 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
ICALP
1990
Springer
15 years 1 months ago
Analytic Variations on the Common Subexpression Problem
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
Philippe Flajolet, Paolo Sipala, Jean-Marc Steyaer...
HEURISTICS
2008
136views more  HEURISTICS 2008»
14 years 8 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
EMNLP
2010
14 years 7 months ago
Resolving Event Noun Phrases to Their Verbal Mentions
Event Anaphora Resolution is an important task for cascaded event template extraction and other NLP study. Previous study only touched on event pronoun resolution. In this paper, ...
Bin Chen, Jian Su, Chew Lim Tan
PG
1997
IEEE
15 years 1 months ago
Real-time virtual humans
The last few years have seen great maturationin the computation speed and control methods needed to portray 3D virtualhumanssuitableforreal interactiveapplications. We first desc...
Norman I. Badler