Sciweavers

11160 search results - page 407 / 2232
» Incompleteness in a General Setting
Sort
View
AGP
1999
IEEE
15 years 11 months ago
The Relative Complement Problem for Higher-Order Patterns
We address the problem of complementing higher-order patterns without repetitions of free variables. Differently from the first-order case, the complement of a pattern cannot, in ...
Alberto Momigliano, Frank Pfenning
FSTTCS
2006
Springer
15 years 10 months ago
On Continuous Timed Automata with Input-Determined Guards
We consider a general class of timed automata parameterized by a set of "input-determined" operators, in a continuous time setting. We show that for any such set of opera...
Fabrice Chevalier, Deepak D'Souza, Pavithra Prabha...
AAAI
2007
15 years 9 months ago
Computing Optimal Subsets
Various tasks in decision making and decision support require selecting a preferred subset of items from a given set of feasible items. Recent work in this area considered methods...
Maxim Binshtok, Ronen I. Brafman, Solomon Eyal Shi...
NIPS
2008
15 years 8 months ago
Rademacher Complexity Bounds for Non-I.I.D. Processes
This paper presents the first Rademacher complexity-based error bounds for noni.i.d. settings, a generalization of similar existing bounds derived for the i.i.d. case. Our bounds ...
Mehryar Mohri, Afshin Rostamizadeh
SERP
2004
15 years 8 months ago
Using ZOOM Approach to Support MDD
Model-Driven Development (MDD) represents a positive step toward a general model-based approach to software engineering. The Object Management Group (OMG) offers a conceptual fram...
Xiaoping Jia, Adam Steele, Hongming Liu, Lizhang Q...