3958 search results - page 237 / 792 » Dynamic Graph Algorithms with Applications |
211
click to vote
ICSM
2002
IEEE
15 years 11 months ago
2002
IEEE
When a software system enters the maintenance phase, the availability of accurate and consistent information about its organization can help alleviate the difficulties of program...
172
click to vote
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
159
click to vote
CCGRID
2009
IEEE
16 years 1 months ago
2009
IEEE
—Current implementations of real-time collaborative applications rely on a dedicated infrastructure to carry out all synchronizing and communication functions, and require all en...
169
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
177
click to vote
WEA
2007
Springer
16 years 21 days ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...