Sciweavers

2200 search results - page 3 / 440
» Programming norm change
Sort
View
ICAIL
2007
ACM
13 years 9 months ago
Variants of temporal defeasible logics for modelling norm modifications
This paper proposes some variants of Temporal Defeasible Logic (TDL) to reason about normative modifications. These variants make it possible to differentiate cases in which, for ...
Guido Governatori, Antonino Rotolo, Régis R...
TIT
2010
130views Education» more  TIT 2010»
13 years 14 days ago
The power of convex relaxation: near-optimal matrix completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
Emmanuel J. Candès, Terence Tao
SIGSOFT
2006
ACM
14 years 6 months ago
Finding failure-inducing changes in java programs using change classification
Testing and code editing are interleaved activities during program development. When tests fail unexpectedly, the changes that caused the failure(s) are not always easy to find. W...
Barbara G. Ryder, Frank Tip, Maximilian Störz...
STOC
2005
ACM
156views Algorithms» more  STOC 2005»
14 years 6 months ago
Convex programming for scheduling unrelated parallel machines
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
Yossi Azar, Amir Epstein
ESAW
2006
Springer
13 years 9 months ago
Adaptation of Autonomic Electronic Institutions Through Norms and Institutional Agents
Electronic institutions (EIs) have been proposed as a means of regulating open agent societies. EIs define the rules of the game in agent societies by fixing what agents are permit...
Eva Bou, Maite López-Sánchez, Juan A...