Sciweavers

88 search results - page 15 / 18
» Faster constraint solving with subtypes
Sort
View
CEC
2009
IEEE
14 years 12 days ago
Performance of infeasibility driven evolutionary algorithm (IDEA) on constrained dynamic single objective optimization problems
Abstract—A number of population based optimization algorithms have been proposed in recent years to solve unconstrained and constrained single and multi-objective optimization pr...
Hemant K. Singh, Amitay Isaacs, Trung Thanh Nguyen...
EATIS
2007
ACM
13 years 11 months ago
Analysing and enhancing business processes and IT-systems for mobile workforce automation: a framework approach
Mobile B2E-applications (business-to-employee) can add significant value to a company's business, when large workforce divisions are involved in the execution of certain busi...
Volker Gruhn, André Köhler
ATAL
2006
Springer
13 years 11 months ago
Adaptive distributed resource allocation and diagnostics using cooperative information-sharing strategies
A major challenge in efficiently solving distributed resource allocation problems is to cope with the dynamic state changes that characterise such systems. An effective solution t...
Partha Sarathi Dutta, Nicholas R. Jennings, Luc Mo...
JMLR
2006
125views more  JMLR 2006»
13 years 7 months ago
Linear Programming Relaxations and Belief Propagation - An Empirical Study
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
Chen Yanover, Talya Meltzer, Yair Weiss
CORR
2010
Springer
131views Education» more  CORR 2010»
13 years 6 months ago
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
Henry Cohn, Nadia Heninger