Sciweavers

2398 search results - page 346 / 480
» Constraint Programming and Graph Algorithms
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 5 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
ICECCS
1998
IEEE
123views Hardware» more  ICECCS 1998»
15 years 9 months ago
Applying Slicing Technique to Software Architectures
Software architecture is receiving increasingly attention as a critical design level for software systems. As software architecture design resources (in the form of architectural ...
Jianjun Zhao
COCOA
2009
Springer
15 years 9 months ago
Positive Influence Dominating Set in Online Social Networks
Online social network has developed significantly in recent years as a medium of communicating, sharing and disseminating information and spreading influence. Most of current resea...
Feng Wang 0002, Erika Camacho, Kuai Xu
JCO
1998
136views more  JCO 1998»
15 years 4 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
ICIP
2008
IEEE
15 years 11 months ago
Time-sequential extraction of motion layers
A new time-sequential approach for motion layer extraction is presented. We assume that the scene can be described by a set of layers associated to affine motion models. In one o...
Matthieu Fradet, Patrick Pérez, Philippe Ro...