Sciweavers

8540 search results - page 1294 / 1708
» The Dynamic Servers Problem
Sort
View
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
15 years 10 months ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...
INFOCOM
2002
IEEE
15 years 10 months ago
Optimal Configuration of OSPF Aggregates
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
Rajeev Rastogi, Yuri Breitbart, Minos N. Garofalak...
RECOMB
1997
Springer
15 years 9 months ago
A branch-and-cut algorithm for multiple sequence alignment
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kur...
CSE
2009
IEEE
15 years 9 months ago
Churn Prediction in MMORPGs: A Social Influence Based Approach
Massively Multiplayer Online Role Playing Games (MMORPGs) are computer based games in which players interact with one another in the virtual world. Worldwide revenues for MMORPGs h...
Jaya Kawale, Aditya Pal, Jaideep Srivastava
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 8 months ago
An empirical investigation of how and why neutrality affects evolutionary search
The effects of neutrality on evolutionary search have been considered in a number of interesting studies, the results of which, however, have been contradictory. Some researchers ...
Edgar Galván López, Riccardo Poli
« Prev « First page 1294 / 1708 Last » Next »