4335 search results - page 149 / 867 » Privatizing Constraint Optimization |
146
Voted
CEC
2007
IEEE
15 years 3 months ago
2007
IEEE
— Memetic algorithms (MAs) combine the global exploration abilities of evolutionary algorithms with a local search to further improve the solutions. While a neighborhood can be e...
109
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
149
click to vote
INFOCOM
2012
IEEE
13 years 5 months ago
2012
IEEE
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...
130
click to vote
ASPDAC
2005
ACM
15 years 9 months ago
2005
ACM
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
147
Voted
WWW
2009
ACM
16 years 4 months ago
2009
ACM
The run-time binding of web services has been recently put forward in order to support rapid and dynamic web service compositions. With the growing number of alternative web servi...