Sciweavers

4940 search results - page 859 / 988
» On the Complexity of Universal Programs
Sort
View
PLANX
2007
15 years 7 months ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...
AVI
2004
15 years 7 months ago
Display space usage and window management operation comparisons between single monitor and multiple monitor users
The continuing trend toward greater processing power, larger storage, and in particular increased display surface by using multiple monitor supports increased multi-tasking by the...
Dugald Ralph Hutchings, Greg Smith, Brian Meyers, ...
CASCON
2004
129views Education» more  CASCON 2004»
15 years 7 months ago
Practical language-independent detection of near-miss clones
Previous research shows that most software systems contain significant amounts of duplicated, or cloned, code. Some clones are exact duplicates of each other, while others differ ...
James R. Cordy, Thomas R. Dean, Nikita Synytskyy
CLIMA
2004
15 years 7 months ago
Verifying Protocol Conformance for Logic-Based Communicating Agents
Communication plays a fundamental role in multi-agents systems. One of the main issues in the design of agent interaction protocols is the verification that a given protocol implem...
Matteo Baldoni, Cristina Baroglio, Alberto Martell...
ERSA
2004
134views Hardware» more  ERSA 2004»
15 years 7 months ago
A High Performance Application Representation for Reconfigurable Systems
Modern reconfigurable computing systems feature powerful hybrid architectures with multiple microprocessor cores, large reconfigurable logic arrays and distributed memory hierarch...
Wenrui Gong, Gang Wang, Ryan Kastner