88 search results - page 15 / 18 » Faster constraint solving with subtypes |
134
click to vote
CEC
2009
IEEE
15 years 8 months ago
2009
IEEE
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...
118
Voted
EATIS
2007
ACM
15 years 7 months ago
2007
ACM
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...
122
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
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...
137
Voted
JMLR
2006
15 years 3 months ago
2006
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...
138
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
: 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 ...