Sciweavers

14704 search results - page 254 / 2941
» computing 2007
Sort
View
98
Voted
AMC
2007
89views more  AMC 2007»
15 years 3 months ago
A numerical iterative scheme for computing finite order rank-one convex envelopes
It is known that the i-th order laminated microstructures can be resolved by the k-th order rank-one convex envelopes with k ≥ i. So the requirement of establishing an efficient ...
Xin Wang, Zhiping Li
144
Voted
RSS
2007
126views Robotics» more  RSS 2007»
15 years 5 months ago
Automatic Scheduling for Parallel Forward Dynamics Computation of Open Kinematic Chains
— Recent progress in the algorithm as well as the processor power have made the dynamics simulation of complex kinematic chains more realistic in various fields such as human mo...
Katsu Yamane, Yoshihiko Nakamura
119
Voted
GECCO
2007
Springer
174views Optimization» more  GECCO 2007»
15 years 7 months ago
Classifier systems that compute action mappings
The learning in a niche based learning classifier system depends both on the complexity of the problem space and on the number of available actions. In this paper, we introduce a ...
Pier Luca Lanzi, Daniele Loiacono
121
Voted
CORR
2007
Springer
82views Education» more  CORR 2007»
15 years 3 months ago
Programs as polygraphs: computability and complexity
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
Guillaume Bonfante, Yves Guiraud
152
Voted
DBSEC
2007
112views Database» more  DBSEC 2007»
15 years 5 months ago
Reliable Delivery of Event Data from Sensors to Actuators in Pervasive Computing Environments
Abstract. The event-condition-action (ECA) paradigm holds enormous potential in pervasive computing environments. However, the problem of reliable delivery of event data, generated...
Sudip Chakraborty, Nayot Poolsappasit, Indrajit Ra...