Sciweavers

2988 search results - page 468 / 598
» Interacting with Web Hierarchies
Sort
View
IPPS
2005
IEEE
14 years 2 months ago
Runtime Empirical Selection of Loop Schedulers on Hyperthreaded SMPs
Hyperthreaded (HT) and simultaneous multithreaded (SMT) processors are now available in commodity workstations and servers. This technology is designed to increase throughput by e...
Yun Zhang, Michael Voss
ATAL
2005
Springer
14 years 2 months ago
From team plan to individual plans: a petri net-based approach
This paper focuses on a framework for representing a team plan and its projections on individual agents. The team plan is represented with a coloured Petri net. Using the implicit...
Olivier Bonnet-Torrés, Catherine Tessier
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
14 years 2 months ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
SG
2005
Springer
14 years 2 months ago
Knowledge in the Loop: Semantics Representation for Multimodal Simulative Environments
This article describes the integration of knowledge based techniques into simulative Virtual Reality (VR) applications. The approach is motivated ltimodal Virtual Construction as a...
Marc Erich Latoschik, Peter Biermann, Ipke Wachsmu...
TBILLC
2005
Springer
14 years 2 months ago
Case Attraction in Ancient Greek
Case attraction has stood as a puzzling, and elusive, oddity of older Indo-European languages. This paper focuses on attraction in Ancient Greek, establishing both the regularity o...
Scott Grimm