Sciweavers

2526 search results - page 364 / 506
» A New Algorithm for Answer Set Computation
Sort
View
JALC
2008
72views more  JALC 2008»
15 years 2 months ago
Maximal Error-Detecting Capabilities of Formal Languages
A combinatorial channel is a set of pairs of words describing all the possible input-output channel situations. We introduce the concept "maximal error-detecting capability&q...
Stavros Konstantinidis, Pedro V. Silva
SIAMJO
2008
93views more  SIAMJO 2008»
15 years 2 months ago
Stochastic Programs with First-Order Dominance Constraints Induced by Mixed-Integer Linear Recourse
We propose a new class of stochastic integer programs whose special features are dominance constraints induced by mixed-integer linear recourse. For these models, we establish clo...
Ralf Gollmer, Frederike Neise, Rüdiger Schult...
TPDS
2002
136views more  TPDS 2002»
15 years 2 months ago
Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
Fabrice Rastello, Yves Robert
115
Voted
DAM
2010
105views more  DAM 2010»
14 years 12 months ago
An iterative approach to graph irregularity strength
An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are all different. The irregularity strength,...
Michael Ferrara, Ronald J. Gould, Michal Karonski,...
122
Voted
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 9 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...