Sciweavers

3318 search results - page 453 / 664
» The Weak Instance Model
Sort
View
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 4 months ago
Extended Computation Tree Logic
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
Roland Axelsson, Matthew Hague, Stephan Kreutzer, ...
CORR
2010
Springer
157views Education» more  CORR 2010»
15 years 4 months ago
Context Ontology Implementation for Smart Home
Context awareness is one of the important fields in ubiquitous computing. Smart Home, a specific instance of ubiquitous computing, provides every family with opportunities to enjo...
Tam Van Nguyen, Wontaek Lim, Huy Anh Nguyen, Deokj...
CORR
2010
Springer
88views Education» more  CORR 2010»
15 years 4 months ago
Grothendieck inequalities for semidefinite programs with rank constraint
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
Jop Briët, Fernando Mário de Oliveira ...
DISOPT
2008
85views more  DISOPT 2008»
15 years 4 months ago
How tight is the corner relaxation?
Given a mixed-integer linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomory's corner relaxation is obtained by drop...
Matteo Fischetti, Michele Monaci
AIR
2006
152views more  AIR 2006»
15 years 4 months ago
Machine learning: a review of classification and combining techniques
Abstract Supervised classification is one of the tasks most frequently carried out by socalled Intelligent Systems. Thus, a large number of techniques have been developed based on ...
Sotiris B. Kotsiantis, Ioannis D. Zaharakis, Panay...