Sciweavers

4959 search results - page 905 / 992
» Imperative Functional Programming
Sort
View
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
15 years 20 days ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
114
Voted
UAI
1997
15 years 13 days ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
86
Voted
ATAL
2010
Springer
15 years 6 days ago
Formalizing organizational constraints: a semantic approach
An organizational modeling language can be used to specify an agent organization in terms of its roles, organizational structure, norms, etc. Such an organizational specification ...
M. Birna van Riemsdijk, Koen V. Hindriks, Catholij...
GECCO
2010
Springer
211views Optimization» more  GECCO 2010»
15 years 6 days ago
Investigating EA solutions for approximate KKT conditions in smooth problems
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
Rupesh Tulshyan, Ramnik Arora, Kalyanmoy Deb, Joyd...
112
Voted
BMCBI
2010
143views more  BMCBI 2010»
14 years 11 months ago
ETE: a python Environment for Tree Exploration
Background: Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relations...
Jaime Huerta-Cepas, Joaquín Dopazo, Toni Ga...