Sciweavers

165 search results - page 24 / 33
» Why Machine Ethics
Sort
View
CGO
2003
IEEE
14 years 3 months ago
Improving Quasi-Dynamic Schedules through Region Slip
Modern processors perform dynamic scheduling to achieve better utilization of execution resources. A schedule created at run-time is often better than one created at compile-time ...
Francesco Spadini, Brian Fahs, Sanjay J. Patel, St...
KBSE
2000
IEEE
14 years 2 months ago
Model Checking Programs
The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it eas...
Willem Visser, Klaus Havelund, Guillaume P. Brat, ...
IPPS
1998
IEEE
14 years 2 months ago
A Molecular Quasi-Random Model of Computations Applied to Evaluate Collective Intelligence
The paper presents how the Random PROLOG Processor (RPP), a bio-inspired model of computations, can be used for formalization and analysis of a phenomenon - the Collective Intelli...
Tadeusz Szuba
INCDM
2010
Springer
146views Data Mining» more  INCDM 2010»
14 years 1 months ago
Learning from Humanoid Cartoon Designs
Abstract. Character design is a key ingredient to the success of any comicbook, graphic novel, or animated feature. Artists typically use shape, size and proportion as the first de...
Md. Tanvirul Islam, Kaiser Md. Nahiduzzaman, Why Y...
AIPS
2004
13 years 11 months ago
Iterative Relaxations for Iterative Flattening in Cumulative Scheduling
Cumulative scheduling is a generalization of jobshop scheduling, where machines have discrete capacities and activities may require several capacity units. This paper considers it...
Laurent Michel, Pascal Van Hentenryck