Sciweavers

7167 search results - page 1074 / 1434
» Answer Set Programming
Sort
View
AAMAS
2011
Springer
14 years 10 months ago
Long-term fairness with bounded worst-case losses
How does one repeatedly choose actions so as to be fairest to the multiple beneficiaries of those actions? We examine approaches to discovering sequences of actions for which the...
Gabriel Catalin Balan, Dana Richards, Sean Luke
TSE
2011
111views more  TSE 2011»
14 years 10 months ago
Software Module Clustering as a Multi-Objective Search Problem
Software module clustering is the problem of automatically organising software units into modules to improve program structure. There has been a great deal of recent interest in s...
Kata Praditwong, Mark Harman, Xin Yao
ICASSP
2010
IEEE
14 years 10 months ago
Unsupervised knowledge acquisition for Extracting Named Entities from speech
This paper presents a Named Entity Recognition (NER) method dedicated to process speech transcriptions. The main principle behind this method is to collect in an unsupervised way ...
Frédéric Béchet, Eric Charton
131
Voted
JMLR
2010
164views more  JMLR 2010»
14 years 10 months ago
Solving the Uncapacitated Facility Location Problem Using Message Passing Algorithms
The Uncapacitated Facility Location Problem (UFLP) is one of the most widely studied discrete location problems, whose applications arise in a variety of settings. We tackle the U...
Nevena Lazic, Brendan J. Frey, Parham Aarabi
140
Voted
CORR
2011
Springer
155views Education» more  CORR 2011»
14 years 7 months ago
On the Generation of Positivstellensatz Witnesses in Degenerate Cases
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
David Monniaux, Pierre Corbineau
« Prev « First page 1074 / 1434 Last » Next »