Sciweavers

1272 search results - page 169 / 255
» The Set Cover with Pairs Problem
Sort
View
ASIAN
2009
Springer
274views Algorithms» more  ASIAN 2009»
13 years 11 months ago
Reducing Equational Theories for the Decision of Static Equivalence
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
AI
2010
Springer
13 years 10 months ago
Learning conditional preference networks
We investigate the problem of eliciting CP-nets in the well-known model of exact learning with equivalence and membership queries. The goal is to identify a preference ordering wi...
Frédéric Koriche, Bruno Zanuttini
CVIU
2006
131views more  CVIU 2006»
13 years 10 months ago
Edge affinity for pose-contour matching
We present an approach for whole-body pose contour matching. Contour matching in natural images in the absence of foreground-background segmentation is difficult. Usually an asymm...
V. Shiv Naga Prasad, Larry S. Davis, Son Dinh Tran...
JALC
2008
72views more  JALC 2008»
13 years 10 months ago
Maximal Error-Detecting Capabilities of Formal Languages
A combinatorial channel is a set of pairs of words describing all the possible input-output channel situations. We introduce the concept "maximal error-detecting capability&q...
Stavros Konstantinidis, Pedro V. Silva
EOR
2002
125views more  EOR 2002»
13 years 10 months ago
Genetic local search for multi-objective combinatorial optimization
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
Andrzej Jaszkiewicz