Sciweavers

3663 search results - page 85 / 733
» Problems in the ontology of computer programs
Sort
View
EOR
2010
140views more  EOR 2010»
14 years 7 months ago
Cutting plane algorithms for 0-1 programming based on cardinality cuts
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
Osman Oguz
AGP
2003
IEEE
15 years 3 months ago
Local Closed-World Assumptions for reasoning about Semantic Web data
Abstract The Semantic Web (SW) can be seen as abstract representation and exchange of data and metadata. Metadata is given in terms of data mark-up and reference to shared, Web-acc...
Elisa Bertino, Alessandro Provetti, Franco Salvett...
WWW
2005
ACM
15 years 10 months ago
OWL DL vs. OWL flight: conceptual modeling and reasoning for the semantic Web
The Semantic Web languages RDFS and OWL have been around for some time now. However, the presence of these languages has not brought the breakthrough of the Semantic Web the creat...
Axel Polleres, Dieter Fensel, Jos de Bruijn, Rub&e...
EUROCRYPT
2003
Springer
15 years 3 months ago
CAPTCHA: Using Hard AI Problems for Security
We introduce captcha, an automated test that humans can pass, but current computer programs can’t pass: any program that has high success over a captcha can be used to solve an u...
Luis von Ahn, Manuel Blum, Nicholas J. Hopper, Joh...
JCO
1998
136views more  JCO 1998»
14 years 9 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...