Sciweavers

3433 search results - page 337 / 687
» Heuristics for a bidding problem
Sort
View
IPPS
2007
IEEE
16 years 1 months ago
Implementing Replica Placements: Feasibility and Cost Minimization
Given two replication schemes old X and new X , the Replica Transfer Scheduling Problem (RTSP) aims at reaching new X , starting from old X , with minimal implementation cost. In ...
Thanasis Loukopoulos, Nikos Tziritas, Petros Lamps...
AI
2007
Springer
16 years 1 months ago
Learning Network Topology from Simple Sensor Data
In this paper, we present an approach for recovering a topological map of the environment using only detection events from a deployed sensor network. Unlike other solutions to this...
Dimitri Marinakis, Philippe Giguère, Gregor...
GECCO
2007
Springer
186views Optimization» more  GECCO 2007»
16 years 1 months ago
A multi-objective approach for the prediction of loan defaults
Credit institutions are seldom faced with problems dealing with single objectives. Often, decisions involving optimizing two or more competing goals simultaneously need to be made...
Oluwarotimi Odeh, Praveen Koduru, Sanjoy Das, Alle...
ICCBR
2007
Springer
16 years 29 days ago
Label Ranking in Case-Based Reasoning
The problem of label ranking has recently been introduced as an extension of conventional classification in the field of machine learning. In this paper, we argue that label ran...
Klaus Brinker, Eyke Hüllermeier
IRI
2006
IEEE
16 years 26 days ago
A new heuristic-based albeit complete method to extract MUCs from unsatisfiable CSPs
When a Constraint Satisfaction Problem (CSP) admits no solution, most current solvers express that the whole search space has been explored unsuccessfully but do not exhibit which...
Éric Grégoire, Bertrand Mazure, C&ea...