Sciweavers

1204 search results - page 70 / 241
» Hybrid Probabilistic Programs
Sort
View
ACL
2006
13 years 11 months ago
A Hybrid Relational Approach for WSD - First Results
We present a novel hybrid approach for Word Sense Disambiguation (WSD) which makes use of a relational formalism to represent instances and background knowledge. It is built using...
Lucia Specia
IJHIS
2007
89views more  IJHIS 2007»
13 years 10 months ago
A new hybrid heuristic for driver scheduling
This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in...
Geraldo R. Mauri, Luiz Antonio Nogueira Lorena
ANOR
2011
158views more  ANOR 2011»
13 years 5 months ago
Hybrid scatter tabu search for unconstrained global optimization
Abstract The problem of finding a global optimum of an unconstrained multimodal function has been the subject of intensive study in recent years, giving rise to valuable advances ...
Abraham Duarte, Rafael Martí, Fred Glover, ...
PLDI
2006
ACM
14 years 4 months ago
DieHard: probabilistic memory safety for unsafe languages
Applications written in unsafe languages like C and C++ are vulnerable to memory errors such as buffer overflows, dangling pointers, and reads of uninitialized data. Such errors ...
Emery D. Berger, Benjamin G. Zorn
TSMC
2010
13 years 4 months ago
An Architecture for Adaptive Algorithmic Hybrids
We describe a cognitive architecture for creating more robust intelligent systems by executing hybrids of algorithms based on different computational formalisms. The architecture ...
Nicholas L. Cassimatis, Perrin G. Bignoli, Magdale...