4208 search results - page 123 / 842 » Challenges in Evaluating Distributed Algorithms |
CEC
2009
IEEE
15 years 1 months ago
2009
IEEE
— The urban transit routing problem (UTRP) for public transport systems involves finding a set of efficient transit routes to meet customer demands. The UTRP is an NPHard, high...
ICIP
2010
IEEE
14 years 8 months ago
2010
IEEE
The process of finding representative shape patterns from sparse datasets is a challenging task: especially for non-rigid objects, shape deformations through time can produce very...
118
click to vote
IJAR
2011
14 years 1 months ago
2011
Sequential pattern mining is a crucial but challenging task in many applications, e.g., analyzing the behaviors of data in transactions and discovering frequent patterns in time se...
DAWAK
2008
Springer
14 years 11 months ago
2008
Springer
The DWS (Data Warehouse Striping) technique is a data partitioning approach especially designed for distributed data warehousing environments. In DWS the fact tables are distribute...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
Hyper-heuristics (HHs) are heuristics that work with an arbitrary set of search operators or algorithms and combine these algorithms adaptively to achieve a better performance tha...