Sciweavers

6455 search results - page 107 / 1291
» Research problems
Sort
View
GECCO
2003
Springer
15 years 11 months ago
A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
William A. Greene
INFORMATICALT
2002
150views more  INFORMATICALT 2002»
15 years 6 months ago
Search for Dynamic Equilibrium in Duel Problems by Global Optimization
Two examples of open-loop differential games are considered in the paper. Starting with simplified dynamic Duel, further it was developed to differential economic Duel modelling pr...
Raimundas Matulevicius
NHM
2010
87views more  NHM 2010»
15 years 1 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...
HICSS
2000
IEEE
104views Biometrics» more  HICSS 2000»
15 years 10 months ago
Fragmentation of Working Time and SMARTER IS-Solutions
It has been commonly stated how complex it is to measure the impact of Information Technology on managers' productivity. We propose to go beyond the concept of productivity i...
Franck Tétard

Publication
147views
14 years 5 months ago
ASPIC: Awareness-based Support Project for Interpersonal Collaboration in Software Engineering
Research the problems caused by the difficulties in GSE with acquiring and maintaining awareness: sufficient contextual information to be able to properly cooperate with others.
Kevin Dullemond, Ben van Gameren, Rini van Solinge...