Sciweavers

1195 search results - page 85 / 239
» New constructions of SSPDs and their applications
Sort
View
DLOG
2007
15 years 8 months ago
Blocking Automata for PSPACE DLs
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
Franz Baader, Jan Hladik, Rafael Peñaloza
APLAS
2008
ACM
15 years 8 months ago
JavaScript Instrumentation in Practice
JavaScript has been exploited to launch various browser-based attacks. Our previous work proposed a theoretical framework applying policy-based code instrumentation to JavaScript. ...
Haruka Kikuchi, Dachuan Yu, Ajay Chander, Hiroshi ...
ECOOP
2008
Springer
15 years 8 months ago
A Uniform Transactional Execution Environment for Java
Abstract. Transactional memory (TM) has recently emerged as an effective tool for extracting fine-grain parallelism from declarative critical sections. In order to make STM systems...
Lukasz Ziarek, Adam Welc, Ali-Reza Adl-Tabatabai, ...
DAGSTUHL
2008
15 years 7 months ago
The Grand Challenges and Myths of Neural-Symbolic Computation
The construction of computational cognitive models integrating the connectionist and symbolic paradigms of artificial intelligence is a standing research issue in the field. The co...
Luís C. Lamb
ALENEX
2001
151views Algorithms» more  ALENEX 2001»
15 years 7 months ago
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
Jill Cirasella, David S. Johnson, Lyle A. McGeoch,...