Sciweavers

5506 search results - page 853 / 1102
» Minimal Logic Programs
Sort
View
DAM
2008
88views more  DAM 2008»
13 years 8 months ago
On the asymmetric representatives formulation for the vertex coloring problem
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
Manoel B. Campêlo, Victor A. Campos, Ricardo...
AUTOMATICA
2006
183views more  AUTOMATICA 2006»
13 years 8 months ago
Bank management via stochastic optimal control
This paper examines a problem related to the optimal risk management of banks in a stochastic dynamic setting. In particular, we minimize7 market and capital adequacy risk that in...
Janine Mukuddem-Petersen, Mark Adam Petersen
CORR
2006
Springer
91views Education» more  CORR 2006»
13 years 8 months ago
The Complexity of Mean Flow Time Scheduling Problems with Release Times
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
Philippe Baptiste, Peter Brucker, Marek Chrobak, C...
ENTCS
2006
118views more  ENTCS 2006»
13 years 8 months ago
An Operational Domain-theoretic Treatment of Recursive Types
We develop a domain theory for treating recursive types with respect to contextual equivalence. The principal approach taken here deviates from classical domain theory in that we ...
Weng Kin Ho
GRID
2006
Springer
13 years 8 months ago
Implementation of Fault-Tolerant GridRPC Applications
In this paper, a task parallel application is implemented with Ninf-G which is a GridRPC system, and experimented on, using the Grid testbed in Asia Pacific, for three months. The...
Yusuke Tanimura, Tsutomu Ikegami, Hidemoto Nakada,...