Sciweavers

14548 search results - page 2544 / 2910
» The Optimal Path-Matching Problem
Sort
View
ATAL
2003
Springer
15 years 12 months ago
Risk-averse auction agents
Auctions are an important means for purchasing material in the era of e-commerce. Research on auctions often studies them in isolation. In practice, however, auction agents are pa...
Yaxin Liu, Richard Goodwin, Sven Koenig
GECCO
2003
Springer
112views Optimization» more  GECCO 2003»
15 years 12 months ago
Limits in Long Path Learning with XCS
The development of the XCS Learning Classifier System [26] has produced a stable implementation, able to consistently identify the accurate and optimally general population of cla...
Alwyn Barry
GECCO
2003
Springer
132views Optimization» more  GECCO 2003»
15 years 12 months ago
Circuit Bipartitioning Using Genetic Algorithm
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
Jong-Pil Kim, Byung Ro Moon
CF
2010
ACM
15 years 12 months ago
Load balancing using dynamic cache allocation
Supercomputers need a huge budget to be built and maintained. To maximize the usage of their resources, application developers spend time to optimize the code of the parallel appl...
Miquel Moretó, Francisco J. Cazorla, Rizos ...
ICNP
2002
IEEE
15 years 11 months ago
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks
The emerging Multi-Protocol Label Switching (MPLS) networks enable network service providers to route bandwidth guaranteed paths between customer sites [3, 2, 8, 5]. This basic La...
Erran L. Li, Milind M. Buddhikot, Chandra Chekuri,...
« Prev « First page 2544 / 2910 Last » Next »