Sciweavers

1450 search results - page 51 / 290
» On the Complexity of Hardness Amplification
Sort
View
ACMSE
2005
ACM
14 years 2 months ago
Reducing application code complexity with vocabulary-specific XML language bindings
The eXtensible Markup Language (XML) has become a ubiquitous data exchange and storage format. A variety of tools are available for incorporating XML-based data into applications....
Jules White, Boris Kolpackov, Balachandran Nataraj...
UC
2005
Springer
14 years 2 months ago
On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
Predrag T. Tosic, Gul A. Agha
AMT
2006
Springer
107views Multimedia» more  AMT 2006»
14 years 22 days ago
An Intelligent Process Monitoring System in Complex Manufacturing Environment
In high-tech industries, most manufacturing processes are complexly intertwined, in that manufacturers or engineers can hardly control a whole set of processes. They are only capa...
Sung Ho Ha, Boo-Sik Kang
ATAL
2006
Springer
14 years 22 days ago
Learning the required number of agents for complex tasks
Coordinating agents in a complex environment is a hard problem, but it can become even harder when certain characteristics of the tasks, like the required number of agents, are un...
Sébastien Paquet, Brahim Chaib-draa
CASES
2001
ACM
14 years 19 days ago
Efficient longest executable path search for programs with complex flows and pipeline effects
Current development tools for embedded real-time systems do not efficiently support the timing aspect. The most important timing parameter for scheduling and system analysis is th...
Friedhelm Stappert, Andreas Ermedahl, Jakob Engblo...