3495 search results - page 589 / 699 » On the random satisfiable process |
160
click to vote
GECCO
2009
Springer
16 years 25 days ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
150
click to vote
KESAMSTA
2009
Springer
16 years 25 days ago
2009
Springer
In this paper, we propose a probabilistic model to study the interaction of bidder and seller agents in sequential automated auctions. We consider a designated “special bidder”...
349
click to vote
WEA
2010
Springer
16 years 23 days ago
2010
Springer
Abstract. A new technique for combinational logic optimization is described. The technique is a two-step process. In the first step, the nonlinearity of a circuit – as measured ...
170
click to vote
CISS
2008
IEEE
16 years 22 days ago
2008
IEEE
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
152
click to vote
FOCS
2008
IEEE
16 years 22 days ago
2008
IEEE
What is the least surface area of a shape that tiles Rd under translations by Zd ? Any such shape must have volume 1 and hence surface area at least that of the volume-1 ball, nam...