Sciweavers

3415 search results - page 468 / 683
» Lower bounds on kernelization
Sort
View
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
15 years 8 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
DATE
2008
IEEE
163views Hardware» more  DATE 2008»
15 years 8 months ago
A Simulation Methodology for Worst-Case Response Time Estimation of Distributed Real-Time Systems
In this paper, we propose a simulation-based methodology for worst-case response time estimation of distributed realtime systems. Schedulability analysis produces pessimistic uppe...
Soheil Samii, Sergiu Rafiliu, Petru Eles, Zebo Pen...
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
15 years 8 months ago
Stochastic analyses for online combinatorial optimization problems
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...
ACL
2001
15 years 8 months ago
Mapping Lexical Entries in a Verbs Database to WordNet Senses
This paper describes automatic techniques for mapping 9611 entries in a database of English verbs to WordNet senses. The verbs were initially grouped into 491 classes based on syn...
Rebecca Green, Lisa Pearl, Bonnie J. Dorr, Philip ...
NIPS
2004
15 years 8 months ago
Co-Validation: Using Model Disagreement on Unlabeled Data to Validate Classification Algorithms
In the context of binary classification, we define disagreement as a measure of how often two independently-trained models differ in their classification of unlabeled data. We exp...
Omid Madani, David M. Pennock, Gary William Flake