Sciweavers

3663 search results - page 86 / 733
» Problems in the ontology of computer programs
Sort
View
DIS
2009
Springer
15 years 4 months ago
Linear Programming Boosting by Column and Row Generation
Abstract. We propose a new boosting algorithm based on a linear programming formulation. Our algorithm can take advantage of the sparsity of the solution of the underlying optimiza...
Kohei Hatano, Eiji Takimoto
IWPEC
2004
Springer
15 years 3 months ago
The Minimum Weight Triangulation Problem with Few Inner Points
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
Michael Hoffmann, Yoshio Okamoto
ICDCS
2002
IEEE
15 years 2 months ago
The Complexity of Adding Failsafe Fault-Tolerance
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
Sandeep S. Kulkarni, Ali Ebnenasir
EGC
2005
Springer
15 years 3 months ago
Automatic Composition and Selection of Semantic Web Services
Interactive applications like Problem Solving Environments require on demand access to Web Services, where the services are autonomously discovered, composed, selected and invocate...
Tor Arne Kvaløy, Erik Rongen, Alfredo Tirad...
AMW
2010
14 years 11 months ago
Updating ABoxes in DL-Lite
Abstract. We study the problem of instance level (ABox) updates for Knowledge Bases (KBs) represented in Description Logics of the DL-Lite family. DLLite is at the basis of OWL 2 Q...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt, Dm...