Sciweavers

2796 search results - page 506 / 560
» The coolest path problem
Sort
View
COR
2010
110views more  COR 2010»
14 years 12 months ago
An evolutionary method for complex-process optimization
In this paper we present a new evolutionary method for complex-process optimization. It is partially based on principles of the scatter search methodology, but it makes use of inn...
Jose A. Egea, Rafael Martí, Julio R. Banga
CORR
2008
Springer
106views Education» more  CORR 2008»
14 years 12 months ago
Resource Allocation and Relay Selection for Collaborative Communications
Abstract--We investigate the relay selection problem in a network where users are able to collaborate with each other; decode and forward the messages of each other along with thei...
Saeed Akhavan-Astaneh, Saeed Gazor
CORR
2008
Springer
111views Education» more  CORR 2008»
14 years 12 months ago
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
David Eppstein, Michael T. Goodrich, Darren Strash
ESWA
2008
102views more  ESWA 2008»
14 years 12 months ago
Hierarchical classifier with overlapping class groups
In this paper a novel complex classifier architecture is proposed. The architecture has a hierarchical tree-like structure with simple artificial neural networks (ANNs) at each no...
Igor T. Podolak
GRID
2008
Springer
14 years 12 months ago
Cost and accuracy sensitive dynamic workflow composition over grid environments
A myriad of recent activities can be seen towards dynamic workflow composition for processing complex and data intensive problems. Meanwhile, the simultaneous emergence of the gri...
David Chiu, Sagar Deshpande, Gagan Agrawal, Rongxi...