Sciweavers

1433 search results - page 262 / 287
» On Covering Problems of Rado
Sort
View
FUIN
2007
134views more  FUIN 2007»
14 years 11 months ago
Complexity Issues in Multiagent Logics
Abstract. Our previous research presents a methodology of cooperative problem solving for beliefdesire-intention (BDI) systems, based on a complete formal theory called TEAMLOG. Th...
Marcin Dziubinski, Rineke Verbrugge, Barbara Dunin...
ANOR
2005
160views more  ANOR 2005»
14 years 11 months ago
Packing r-Cliques in Weighted Chordal Graphs
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, F...
JAIR
2007
120views more  JAIR 2007»
14 years 11 months ago
An Algebraic Graphical Model for Decision with Uncertainties, Feasibilities, and Utilities
Numerous formalisms and dedicated algorithms have been designed in the last decades to model and solve decision making problems. Some formalisms, such as constraint networks, can ...
Cédric Pralet, Gérard Verfaillie, Th...
JUCS
2007
95views more  JUCS 2007»
14 years 11 months ago
Using Place Invariants and Test Point Placement to Isolate Faults in Discrete Event Systems
: This paper describes a method of using Petri net P-invariants in system diagnosis. To model this process a net oriented fault classification is presented. Hence, the considered d...
Iwan Tabakow
MST
2000
57views more  MST 2000»
14 years 11 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast