Sciweavers

13376 search results - page 163 / 2676
» Problem Solving with
Sort
View
CVPR
2007
IEEE
16 years 5 months ago
P3 & Beyond: Solving Energies with Higher Order Cliques
In this paper we extend the class of energy functions for which the optimal -expansion and -swap moves can be computed in polynomial time. Specifically, we introduce a class of hi...
Pushmeet Kohli, M. Pawan Kumar, Philip H. S. Torr
ICANN
2010
Springer
15 years 3 months ago
Solving Independent Component Analysis Contrast Functions with Particle Swarm Optimization
Independent Component Analysis (ICA) is a statistical computation method that transforms a random vector in another one whose components are independent. Because the marginal distr...
Jorge Igual, Jehad I. Ababneh, Raul Llinares, Juli...
CPC
2006
110views more  CPC 2006»
15 years 3 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin
ENTCS
2006
136views more  ENTCS 2006»
15 years 3 months ago
Adaptive Application of SAT Solving Techniques
New heuristics and strategies have enabled major advancements in SAT solving in recent years. However, experimentation has shown that there is no winning solution that works in al...
Ohad Shacham, Karen Yorav
ENDM
2010
141views more  ENDM 2010»
15 years 3 months ago
Solving Replica Placement and Request Distribution in Content Distribution Networks
A Content Distribution Network (CDN) is an overlay network where servers replicate contents and distribute client's requests with the aim at reducing delay, server load and n...
Tiago Araújo Neves, Lúcia Maria de A...