Sciweavers

16404 search results - page 428 / 3281
» A set coverage problem
Sort
View
IJCAI
1993
15 years 8 months ago
The Range of Applicability of Nonmonotonic Logics for the Inertia Problem
We introduce and use a new methodology for the study of logics for action and change. The methodology allows one to define a taxonomy of reasoning problems, based in particular on...
Erik Sandewall
ISDA
2010
IEEE
15 years 4 months ago
Avoiding simplification strategies by introducing multi-objectiveness in real world problems
Abstract--In business analysis, models are sometimes oversimplified. We pragmatically approach many problems with a single financial objective and include monetary values for non-m...
Charlotte J. C. Rietveld, Gijs P. Hendrix, Frank T...
SDM
2009
SIAM
219views Data Mining» more  SDM 2009»
16 years 4 months ago
A Hybrid Data Mining Metaheuristic for the p-Median Problem.
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In t...
Alexandre Plastino, Erick R. Fonseca, Richard Fuch...
COLT
2001
Springer
15 years 11 months ago
Ultraconservative Online Algorithms for Multiclass Problems
In this paper we study a paradigm to generalize online classification algorithms for binary classification problems to multiclass problems. The particular hypotheses we investig...
Koby Crammer, Yoram Singer
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
16 years 8 months ago
Adjourn State Concurrency Control Avoiding Time-Out Problems in Atomic Commit Protocols
Abstract-- The use of atomic commit protocols in mobile adhoc networks involves difficulties in setting up reasonable timeouts for aborting a pending distributed transaction. This ...
George Samaras, Martin Hett, Panos K. Chrysanthis,...