Sciweavers

1312 search results - page 164 / 263
» Formally Optimal Boxing
Sort
View
EACL
2003
ACL Anthology
13 years 11 months ago
Describing Syntax with Star-Free Regular Expressions
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
Anssi Yli-Jyrä
MASCOTS
2004
13 years 11 months ago
A Framework for Resource Allocation in Grid Computing
Grid computing is the future computing paradigm for enterprise applications. An enterprise application running on a grid is composed of a set of SLA-constrained sub-tasks demandin...
Daniel A. Menascé, Emiliano Casalicchio
FLAIRS
2003
13 years 11 months ago
The Rule Retranslation Problem and the Validation Interface
Current rule base maintenance is wasting refinement and inference performance. There are only few maintenance concepts, which enjoy both (1) formal rule refinement and (2) utili...
Hans-Werner Kelbassa, Rainer Knauf
NIPS
2004
13 years 11 months ago
Learning, Regularization and Ill-Posed Inverse Problems
Many works have shown that strong connections relate learning from examples to regularization techniques for ill-posed inverse problems. Nevertheless by now there was no formal ev...
Lorenzo Rosasco, Andrea Caponnetto, Ernesto De Vit...
IJCAI
2003
13 years 11 months ago
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques
Many real life optimization problems contain both hard and soft constraints, as well as qualitative conditional preferences. However, there is no single formalism to specify all t...
Carmel Domshlak, Francesca Rossi, Kristen Brent Ve...