Sciweavers

300 search results - page 3 / 60
» Vertex Cover: Further Observations and Further Improvements
Sort
View
ICASSP
2011
IEEE
12 years 8 months ago
MAP-based estimation of the parameters of non-stationary Gaussian processes from noisy observations
The paper proposes a modification of the standard maximum a posteriori (MAP) method for the estimation of the parameters of a Gaussian process for cases where the process is supe...
Alexander Krueger, Reinhold Haeb-Umbach
LREC
2010
189views Education» more  LREC 2010»
13 years 6 months ago
Constructing an Annotated Story Corpus: Some Observations and Issues
This paper discusses our ongoing work on constructing an annotated corpus of children's stories for further studies on the linguistic, computational, and cognitive aspects of...
Oi Yee Kwong
JAIR
2007
141views more  JAIR 2007»
13 years 4 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
CORR
2008
Springer
90views Education» more  CORR 2008»
13 years 5 months ago
An Indirect Genetic Algorithm for Set Covering Problems
This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. ...
Uwe Aickelin
AAAI
2011
12 years 4 months ago
Risk-Averse Strategies for Security Games with Execution and Observational Uncertainty
Attacker-defender Stackelberg games have become a popular game-theoretic approach for security with deployments for LAX Police, the FAMS and the TSA. Unfortunately, most of the ex...
Zhengyu Yin, Manish Jain, Milind Tambe, Fernando O...