Sciweavers

6368 search results - page 189 / 1274
» Modeling Problem Transformations based on Data Complexity
Sort
View
GCC
2003
Springer
15 years 11 months ago
A Formal Data Model and Algebra for Resource Sharing in Grid
Management of various complex resources is an important issue to be well done, in order to fulfill the potential of Grid. In this paper, we propose a formal data model and algebra ...
Qiujian Sheng, Zhongzhi Shi
BIRTHDAY
2005
Springer
16 years 44 min ago
Towards Comprehensive Computational Models for Plan-Based Control of Autonomous Robots
In this paper we present an overview of recent developments in the plan-based control of autonomous robots. We identify computational principles that enable autonomous robots to a...
Michael Beetz
JVA
2006
IEEE
16 years 14 days ago
Simulated Annealing for Grid Scheduling Problem
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
Stefka Fidanova
ICS
2010
Tsinghua U.
16 years 3 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
153
Voted
ISLPED
1996
ACM
102views Hardware» more  ISLPED 1996»
15 years 10 months ago
High-level power estimation and the area complexity of Boolean functions
Estimation of the area complexity of a Boolean function from its functional description is an important step towards a power estimation capability at the register transfer level (...
Mahadevamurty Nemani, Farid N. Najm