Sciweavers

925 search results - page 47 / 185
» A Solution to the Extended GCD Problem
Sort
View
AMAI
2004
Springer
14 years 1 months ago
Symmetry Breaking in Constraint Satisfaction with Graph-Isomorphism: Comma-Free Codes
In this paper the use of graph isomorphism is investigated within the framework of symmetry breaking in constraint satisfaction problems. A running example of Comma-free codes is ...
Justin Pearson
AUTOMATICA
2007
84views more  AUTOMATICA 2007»
13 years 8 months ago
Nonsmooth optimization for multiband frequency domain control design
Multiband frequency domain synthesis consists in the minimization of a finite family of closed-loop transfer functions on prescribed frequency intervals. This is an algorithmical...
Pierre Apkarian, Dominikus Noll
NETWORKS
2008
13 years 7 months ago
A linear programming approach to increasing the weight of all minimum spanning trees
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
Mourad Baïou, Francisco Barahona
ACL
2010
13 years 5 months ago
An Open-Source Package for Recognizing Textual Entailment
This paper presents a general-purpose open source package for recognizing Textual Entailment. The system implements a collection of algorithms, providing a configurable framework ...
Milen Kouylekov, Matteo Negri
MFCS
2004
Springer
14 years 1 months ago
The Bidimensional Theory of Bounded-Genus Graphs
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitr...