Sciweavers

8413 search results - page 1089 / 1683
» Ordering Problem Subgoals
Sort
View
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
16 years 1 months ago
Methodology to select solutions from the pareto-optimal set: a comparative study
The resolution of a Multi-Objective Optimization Problem (MOOP) does not end when the Pareto-optimal set is found. In real problems, a single solution must be selected. Ideally, t...
José C. Ferreira, Carlos M. Fonseca, Ant&oa...
IPPS
2005
IEEE
16 years 25 days ago
Energy-Aware Task Scheduling: Towards Enabling Mobile Computing over MANETs
Enabling high performance, persistent mobile computing has recently become a very active research area. The widespread popularity of mobile computing devices, such as laptops, han...
Waleed Alsalih, Selim G. Akl, Hossam S. Hassanein
PLDI
2005
ACM
16 years 24 days ago
Jungloid mining: helping to navigate the API jungle
Reuse of existing code from class libraries and frameworks is often difficult because APIs are complex and the client code required to use the APIs can be hard to write. We obser...
David Mandelin, Lin Xu, Rastislav Bodík, Do...
WS
2005
ACM
16 years 24 days ago
A framework for MAC protocol misbehavior detection in wireless networks
The pervasiveness of wireless devices and the architectural organization of wireless networks in distributed communities, where no notion of trust can be assumed, are the main rea...
Svetlana Radosavac, John S. Baras, Iordanis Koutso...
CP
2005
Springer
16 years 23 days ago
Neighbourhood Clause Weight Redistribution in Local Search for SAT
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
Abdelraouf Ishtaiwi, John Thornton, Abdul Sattar, ...
« Prev « First page 1089 / 1683 Last » Next »