Algorithms | Sciweavers

66

ACID
2006

220views Algorithms» more ACID 2006»

Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms

14 years 1 months ago

We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...

Henning Fernau, David Manlove

claim paper

Read More »

51

click to vote

ACID
2006

274views Algorithms» more ACID 2006»

Sampling Eulerian Orientations of the Triangle

14 years 1 months ago

Download homepages.inf.ed.ac.uk

Páidí J. Creed

claim paper

Read More »

41

click to vote

ACID
2006

352views Algorithms» more ACID 2006»

Matrix Robustness, with an Application to Power System Observability

14 years 1 months ago

Download theinf1.informatik.uni-jena.de

Matthias Brosemann, Jochen Alber, Falk Hüffne...

claim paper

Read More »

38

click to vote

ACID
2006

236views Algorithms» more ACID 2006»

Kernelization for Convex Recoloring

14 years 1 months ago

Download mrfellows.net

The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...

Hans L. Bodlaender, Michael R. Fellows, Michael A....

claim paper

Read More »

38

click to vote

AAAI
2006

105views Intelligent Agents» more AAAI 2006»

Learning Partially Observable Action Models: Efficient Algorithms

14 years 1 months ago

Download www.aaai.org

We present tractable, exact algorithms for learning actions' effects and preconditions in partially observable domains. Our algorithms maintain a propositional logical repres...

Dafna Shahaf, Allen Chang, Eyal Amir

claim paper

Read More »

34

click to vote

AAAI
2006

89views Intelligent Agents» more AAAI 2006»

Optimal Scheduling of Contract Algorithms for Anytime Problems

14 years 1 months ago

Download www.aaai.org

A contract algorithm is an algorithm which is given, as part of the input, a specified amount of allowable computation time. The algorithm must then compute a solution within the ...

Alejandro López-Ortiz, Spyros Angelopoulos,...

claim paper

Read More »

28

click to vote

AAAI
2006

121views Intelligent Agents» more AAAI 2006»

Efficient L1 Regularized Logistic Regression

14 years 1 months ago

Download www.stanford.edu

L1 regularized logistic regression is now a workhorse of machine learning: it is widely used for many classification problems, particularly ones with many features. L1 regularized...

Su-In Lee, Honglak Lee, Pieter Abbeel, Andrew Y. N...

claim paper

Read More »

16

click to vote

AAAI
2004

89views Intelligent Agents» more AAAI 2004»

Low-Knowledge Algorithm Control

14 years 1 months ago

Download tidel.mie.utoronto.ca

This paper addresses the question of allocating computational resources among a set of algorithms in order to achieve the best performance on a scheduling problem instance. Our pr...

Tom Carchrae, J. Christopher Beck

claim paper

Read More »

48

click to vote

SODA
2007
ACM

145views Algorithms» more SODA 2007»

Aggregation of partial rankings, p-ratings and top-m lists

14 years 1 months ago

Download www.cs.technion.ac.il

We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam ﬁghting, e-c...

Nir Ailon

claim paper

Read More »

20

click to vote

SODA
2007
ACM

95views Algorithms» more SODA 2007»

Dynamic pricing for impatient bidders

14 years 1 months ago

Download domino.research.ibm.com

Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri R...

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers