Sciweavers

1204 search results - page 126 / 241
» Hybrid Probabilistic Programs
Sort
View
89
Voted
COR
2010
166views more  COR 2010»
15 years 26 days ago
Variable neighbourhood decomposition search for 0-1 mixed integer programs
In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable ...
Jasmina Lazic, Saïd Hanafi, Nenad Mladenovic,...
ICTAI
2010
IEEE
14 years 10 months ago
Combining Mixed Integer Programming and Supervised Learning for Fast Re-planning
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...
Emmanuel Rachelson, Ala Ben Abbes, Sebastien Dieme...
126
Voted
JOLLI
2008
145views more  JOLLI 2008»
15 years 22 days ago
Temporal Languages for Epistemic Programs
This paper adds temporal logic to public announcement logic (PAL) and dynamic epistemic logic (DEL). By adding a previous-time operator to PAL, we express in the language statemen...
Joshua Sack
JSW
2006
98views more  JSW 2006»
15 years 22 days ago
A Jxta Based Asynchronous Peer-to-Peer Implementation of Genetic Programming
Abstract-- Solving complex real-world problems using evolutionary computation is a CPU time-consuming task that requires a large amount of computational resources. Peerto-Peer (P2P...
Gianluigi Folino, Agostino Forestiero, Giandomenic...
APIN
1998
139views more  APIN 1998»
15 years 14 days ago
Evolutionary Learning of Modular Neural Networks with Genetic Programming
Evolutionary design of neural networks has shown a great potential as a powerful optimization tool. However, most evolutionary neural networks have not taken advantage of the fact ...
Sung-Bae Cho, Katsunori Shimohara