Sciweavers

362 search results - page 35 / 73
» Mechanizing and Improving Dependency Pairs
Sort
View
TPHOL
2008
IEEE
14 years 2 months ago
Certifying a Termination Criterion Based on Graphs, without Graphs
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
Pierre Courtieu, Julien Forest, Xavier Urbain
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
14 years 1 months ago
Sex and death: towards biologically inspired heuristics for constraint handling
Constrained continuous optimization is still an interesting field of research. Many heuristics have been proposed in the last decade. Most of them are based on penalty functions....
Oliver Kramer, Stephan Brügger, Dejan Lazovic
MSN
2007
Springer
124views Sensor Networks» more  MSN 2007»
14 years 1 months ago
Reducing End-to-End Delay in Multi-path Routing Algorithms for Mobile Ad Hoc Networks
Some of the routing algorithms in mobile ad hoc networks use multiple paths simultaneously. These algorithms can attempt to find nodedisjoint paths to achieve higher fault toleranc...
Nastooh Taheri Javan, Mehdi Dehghan
IPPS
2007
IEEE
14 years 1 months ago
Evolution of Strategy Driven Behavior in Ad Hoc Networks Using a Genetic Algorithm
In this paper we address the problem of selfish behavior in ad hoc networks. We propose a strategy driven approach which aims at enforcing cooperation between network participant...
Marcin Seredynski, Pascal Bouvry, Mieczyslaw A. Kl...
ICSEA
2006
IEEE
14 years 1 months ago
Enforcing Interaction Properties in AOSD-Enabled Systems
The construction and maintenance of large and complex software systems depend on the existence of global principles describing the structure and the interaction among its various ...
Constantin Serban, Shmuel S. Tyszberowicz