Sciweavers

962 search results - page 35 / 193
» Near-optimal solutions for the generalized max-controlled se...
Sort
View
AI
1998
Springer
14 years 9 months ago
A Complete Anytime Algorithm for Number Partitioning
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
Richard E. Korf
COMPGEOM
2003
ACM
15 years 3 months ago
the asteroid surveying problem and other puzzles
We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...
Timothy M. Chan, Alexander Golynski, Alejandro L&o...
ADBIS
2010
Springer
154views Database» more  ADBIS 2010»
14 years 11 months ago
Platform Independent Database Replication Solution Applied to Medical Information System
Medical Information Systems (MIS) in general, like any other complex and large system, can be based on centralized or distributed DBMS. Centralized system is much easier for implem...
Tatjana Stankovic, Srebrenko Pesic, Dragan Jankovi...
AIR
2004
130views more  AIR 2004»
14 years 9 months ago
A Hybrid Framework for Over-Constrained Generalized
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fe...
TACAS
2010
Springer
251views Algorithms» more  TACAS 2010»
15 years 3 months ago
Approximating the Pareto Front of Multi-criteria Optimization Problems
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...
Julien Legriel, Colas Le Guernic, Scott Cotton, Od...