Sciweavers

3663 search results - page 31 / 733
» Problems in the ontology of computer programs
Sort
View
CORR
2002
Springer
111views Education» more  CORR 2002»
13 years 8 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
CP
2009
Springer
14 years 9 months ago
Solving a Location-Allocation Problem with Logic-Based Benders' Decomposition
Abstract. We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capaci...
Mohammad M. Fazel-Zarandi, J. Christopher Beck
CCO
2001
Springer
256views Combinatorics» more  CCO 2001»
14 years 1 months ago
General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms
In this paper we survey the basic features of state-of-the-art branch-and-cut algorithms for the solution of general mixed integer programming problems. In particular we focus on p...
Alexander Martin
INFOCOM
2011
IEEE
13 years 1 days ago
Secure and practical outsourcing of linear programming in cloud computing
—Cloud Computing has great potential of providing robust computational power to the society at reduced cost. It enables customers with limited computational resources to outsourc...
Cong Wang, Kui Ren, Jia Wang
WS
2008
ACM
13 years 8 months ago
OWL 2: The next step for OWL
Since achieving W3C recommendation status in 2004, the Web Ontology Language (OWL) has been successfully applied to many problems in computer science. Practical experience with OW...
Bernardo Cuenca Grau, Ian Horrocks, Boris Motik, B...