Sciweavers

357 search results - page 39 / 72
» Is Computational Complexity a Barrier to Manipulation
Sort
View
CORR
2007
Springer
68views Education» more  CORR 2007»
15 years 5 months ago
An Improved Tight Closure Algorithm for Integer Octagonal Constraints
Integer octagonal constraints (a.k.a. Unit Two Variables Per Inequality or UTVPI integer constraints) constitute an interesting class of constraints for the representation and solu...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
IJON
2007
84views more  IJON 2007»
15 years 5 months ago
Modeling self-developing biological neural networks
Recent progress in chips–neuron interface suggests real biological neurons as long-term alternatives to silicon transistors. The first step ning such computing systems is to bu...
Hugues Berry, Olivier Temam
ISCA
2009
IEEE
161views Hardware» more  ISCA 2009»
16 years 14 days ago
AnySP: anytime anywhere anyway signal processing
In the past decade, the proliferation of mobile devices has increased at a spectacular rate. There are now more than 3.3 billion active cell phones in the world—a device that we...
Mark Woh, Sangwon Seo, Scott A. Mahlke, Trevor N. ...
CCGRID
2007
IEEE
16 years 5 days ago
Revisit of View-Oriented Parallel Programming
Traditional parallel programming styles have many problems which hinder the development of parallel applications. The message passing style can be too complex for many programmers...
Z. Huang, W. Chen
ICDCS
1999
IEEE
15 years 10 months ago
Run-time Detection in Parallel and Distributed Systems: Application to Safety-Critical Systems
There is growing interest in run-time detection as parallel and distributed systems grow larger and more complex. This work targets run-time analysis of complex, interactive scien...
Beth Plale, Karsten Schwan