Sciweavers

804 search results - page 49 / 161
» Solutions to Computational Problems Through Gene Assembly
Sort
View
114
Voted
DAC
2005
ACM
16 years 1 months ago
Memory access optimization through combined code scheduling, memory allocation, and array binding in embedded system design
In many of embedded systems, particularly for those with high data computations, the delay of memory access is one of the major bottlenecks in the system's performance. It ha...
Jungeun Kim, Taewhan Kim
115
Voted
IJCV
2008
157views more  IJCV 2008»
15 years 6 days ago
Pairwise Matching of 3D Fragments Using Cluster Trees
Abstract We propose a novel and efficient surface matching approach for reassembling broken solids as well as for matching assembly components using cluster trees of oriented point...
Simon Winkelbach, Friedrich M. Wahl
IEEESCC
2009
IEEE
15 years 7 months ago
Web Service Substitution Based on Preferences Over Non-functional Attributes
In many applications involving composite Web services, one or more component services may become unavailable. This presents us with the problem of identifying other components tha...
Ganesh Ram Santhanam, Samik Basu, Vasant Honavar
COORDINATION
2000
Springer
15 years 5 months ago
An Agent Mediated Approach to Dynamic Change in Coordination Policies
Distributed information systems for decision-support, logistics, and e-commerce involve coordination of autonomous information resources and clients according to specific domain in...
Prasanta K. Bose, Mark G. Matthews
GECCO
2007
Springer
289views Optimization» more  GECCO 2007»
15 years 6 months ago
A discrete particle swarm optimization algorithm for the generalized traveling salesman problem
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan,...