Results 1  10
of
6,699
GSAT and Dynamic Backtracking
 Journal of Artificial Intelligence Research
, 1994
"... There has been substantial recent interest in two new families of search techniques. One family consists of nonsystematic methods such as gsat; the other contains systematic approaches that use a polynomial amount of justification information to prune the search space. This paper introduces a new te ..."
Abstract

Cited by 389 (15 self)
 Add to MetaCart
, and examples include propositional theorem proving, map coloring and scheduling problems. The probl...
Codes and Decoding on General Graphs
, 1996
"... Iterative decoding techniques have become a viable alternative for constructing high performance coding systems. In particular, the recent success of turbo codes indicates that performance close to the Shannon limit may be achieved. In this thesis, it is showed that many iterative decoding algorithm ..."
Abstract

Cited by 359 (1 self)
 Add to MetaCart
Iterative decoding techniques have become a viable alternative for constructing high performance coding systems. In particular, the recent success of turbo codes indicates that performance close to the Shannon limit may be achieved. In this thesis, it is showed that many iterative decoding algorithms are special cases of two generic algorithms, the minsum and sumproduct algorithms, which also include noniterative algorithms such as Viterbi decoding. The minsum and sumproduct algorithms are developed and presented as generalized trellis algorithms, where the time axis of the trellis is replaced by an arbitrary graph, the "Tanner graph". With cyclefree Tanner graphs, the resulting decoding algorithms (e.g., Viterbi decoding) are maximumlikelihood but suffer from an exponentially increasing complexity. Iterative decoding occurs when the Tanner graph has cycles (e.g., turbo codes); the resulting algorithms are in general suboptimal, but significant complexity reductions are possible compared to the cyclefree case. Several performance estimates for iterative decoding are developed, including a generalization of the union bound used with Viterbi decoding and a characterization of errors that are uncorrectable after infinitely many decoding iterations.
Practical Graph Isomorphism
, 1981
"... We develop an improved algorithm for canonically labelling a graph and finding generators for its automorph.ism grou.p. The emphasis i, on th.e power of the algorithm for,01 fling pr4ctical problem.t, rather than on the theoretical n,icetiu of tJu algo rith.m. Th.e nsult is a.n implementa.tion wh.ic ..."
Abstract

Cited by 334 (7 self)
 Add to MetaCart
We develop an improved algorithm for canonically labelling a graph and finding generators for its automorph.ism grou.p. The emphasis i, on th.e power of the algorithm for,01 fling pr4ctical problem.t, rather than on the theoretical n,icetiu of tJu algo rith.m. Th.e nsult is a.n implementa.tion wh.ich011.11. 11I.ccel8/w.ly hll.ndle many grll.ph. & with. II. thot/.,1a.nd or m ore vertice~, a.nd i & ver y likely the most powerful graphisomorphism program currently in use.
Joint Scheduling and Power Control for Wireless Adhoc Networks
, 2002
"... In this pape we introduce powe r control as a solution tothe multiple accel proble in conte tionbase wirenb adhocne works.The motivation for this study is two fold, limiting multiuse intej toincre single hop throughput, andrej powe r consumption to increj batte life We focus onne ne bor transmi ..."
Abstract

Cited by 282 (6 self)
 Add to MetaCart
In this pape we introduce powe r control as a solution tothe multiple accel proble in conte tionbase wirenb adhocne works.The motivation for this study is two fold, limiting multiuse intej toincre single hop throughput, andrej powe r consumption to increj batte life We focus onne ne bor
Some efficient solutions to the affine scheduling problem  Part I Onedimensional Time
, 1996
"... Programs and systems of recurrence equations may be represented as sets of actions which are to be executed subject to precedence constraints. In many cases, actions may be labelled by integral vectors in some iteration domain, and precedence constraints may be described by affine relations. A s ..."
Abstract

Cited by 271 (22 self)
 Add to MetaCart
Programs and systems of recurrence equations may be represented as sets of actions which are to be executed subject to precedence constraints. In many cases, actions may be labelled by integral vectors in some iteration domain, and precedence constraints may be described by affine relations. A schedule for such a program is a function which assigns an execution date to each action. Knowledge of such a schedule allows one to estimate the intrinsic degree of parallelism of the program and to compile a parallel version for multiprocessor architectures or systolic arrays. This paper deals with the problem of finding closed form schedules as affine or piecewise affine functions of the iteration vector. An efficient algorithm is presented which reduces the scheduling problem to a parametric linear program of small size, which can be readily solved by an efficient algorithm.
THE MUTUAL EXCLUSION PROBLE3I
, 1970
"... This paper discusses how n components, which may be programs or circuits, in a computer system can be controlled so that (1) at most one component may perform a designated "critical " operation at any instant and (2) if one component wants to perform its critical operation, it is ..."
Abstract
 Add to MetaCart
This paper discusses how n components, which may be programs or circuits, in a computer system can be controlled so that (1) at most one component may perform a designated "critical " operation at any instant and (2) if one component wants to perform its critical operation, it is eventually allowed to do so. This control problem is known as the mutual exclusion or interlock problem. A summary of the flow table model * for computer systems is given, In this model, a control algorithm is represented by a flow table. The number of internal states in the control flow table is used as a measure of the complexity of control algorithms. A lower bound of n + 1 internal states i to be necessary if the mutual exclusion problem is to be solved. Procedures to generate control flow tables for the mutual exclusion
Comparing Usability Proble Input to Practical S
"... Usability problems predicted by evaluation techniques are useful input to systems development; it is uncertain whether redesign proposals aimed at alleviating those problems are likewise useful. We present a study of how developers of a large web application assess usability problems and redesign pr ..."
Abstract
 Add to MetaCart
Usability problems predicted by evaluation techniques are useful input to systems development; it is uncertain whether redesign proposals aimed at alleviating those problems are likewise useful. We present a study of how developers of a large web application assess usability problems and redesign proposals as input to their systems development. Problems and redesign proposals were generated by 43 evaluators using an inspection technique and think aloud testing. Developers assessed redesign proposals to have higher utility in their work than usability problems. In interviews they explained how redesign proposals gave them new ideas for tackling well known problems. Redesign proposals were also seen as constructive and concrete input. Few usability problems were new to developers, but the problems supported prioritizing ongoing development of the application and taking design decisions. No developers, however, wanted to receive only problems or redesigns. We suggest developing and using redesign proposals as an integral part of usability evaluation. ACM Classification
On Determining The Fundamental Matrix: Analysis Of Different Methods and . . .
, 1993
"... The Fundamental matrix is a key concept when working with uncalibrated images and multiple viewpoints. It contains all the available geometric information and enables to recover the epipolar geometry from uncalibrated perspective views. This paper addresses the important problem of its robust determ ..."
Abstract

Cited by 96 (15 self)
 Add to MetaCart
The Fundamental matrix is a key concept when working with uncalibrated images and multiple viewpoints. It contains all the available geometric information and enables to recover the epipolar geometry from uncalibrated perspective views. This paper addresses the important problem of its robust
Results 1  10
of
6,699