Results 1  10
of
1,082
Adding constraint solving to Mercury
 Proc. 8th Int. Symposium of Practical Aspects of Declarative Languages (PADL’06), volume 3819 of LNCS
, 2006
"... Abstract. The logic programming language Mercury is designed to support programming in the large. Programmer declarations in conjunction with powerful compiletime analysis and optimization allow Mercury programs to be very efficient. The original design of Mercury did not support constraint logic p ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. The logic programming language Mercury is designed to support programming in the large. Programmer declarations in conjunction with powerful compiletime analysis and optimization allow Mercury programs to be very efficient. The original design of Mercury did not support constraint logic
Randomized Gossip Algorithms
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2006
"... Motivated by applications to sensor, peertopeer, and ad hoc networks, we study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes. The topology of such networks changes continuously as new nodes join a ..."
Abstract

Cited by 532 (5 self)
 Add to MetaCart
Motivated by applications to sensor, peertopeer, and ad hoc networks, we study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes. The topology of such networks changes continuously as new nodes join
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 283 (6 self)
 Add to MetaCart
transmissions whes node are rej tose information packe  tothe re e e re e sub jej to a constraint on the signaltointealtoinjj ratio.The multiple acce  proble is solve via twoaltej phase name schej and powe r control.The sche algorithm isej tial to coordinate the transmissions ofinde ede t use inorde
PROJECTED NEWTON METHODS FOR OPTIMIZATION PROBLEMS WITH SIMPLE CONSTRAINTS
, 1982
"... We consider the problem min {f(x)\x 201, and propose algorithms of the form xk+, = [xtakDkvf(xk)]+, where [.I+ denotes projection on the positive orthant, ak is a stepsize chosen by an Armijolike rule and Dk is a positive definite symmetric matrix which is partly diagonal. We show that Dk can be ..."
Abstract

Cited by 143 (4 self)
 Add to MetaCart
to general linearly constrained problems are also provided. These extensions utilize a notion of an active generalized rectangle patterned after the notion of an active manifold used in manifold suboptimization methods. By contrast with these methods, many constraints can be added or subtracted from
Variational Surface Modeling
 Computer Graphics
, 1992
"... We present a new approach to interactive modeling of freeform surfaces. Instead of a fixed mesh of control points, the model presented to the user is that of an infinitely malleable surface, with no fixed controls. The user is free to apply control points and curves which are then available as handl ..."
Abstract

Cited by 186 (4 self)
 Add to MetaCart
as handles for direct manipulation. The complexity of the surface's shape may be increased by adding more control points and curves, without apparent limit. Within the constraints imposed by the controls, the shape of the surface is fully determined by one or more simple criteria, such as smoothness
Type Constraint Solving for Parametric and Adhoc Polymorphism
, 1999
"... . Unification has long been used as a mechanism for type checking and type inference for HindleyMilner types in functional programming. The programmer defines the possible types, and the compiler uses unification to check and infer types for function definitions. In constraint logic programming it ..."
Abstract

Cited by 18 (8 self)
 Add to MetaCart
disjunctive type definitions, we use methods of propagation based constraint solving and memoing to ...
Herbrand Constraint Solving in HAL
, 1999
"... HAL is a new constraint logic programming language specifically designed to support the construction of and experimentation with constraint solvers. One of the most important constraint solvers in any logic programming language is the Herbrand (or term) constraint solver. HAL programs are compiled t ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
representation used in the WAM, we can implement a solver which interacts gracefully with Mercury's term representation. Like Mercury, HAL allows type, mode and determinism declarations. HAL uses information from these declarations to reduce the overhead of Herbrand constraint solving wherever possible. We
Solving linear arithmetic constraints
 SRI International, Computer Science Laboratory
, 2004
"... Linear arithmetic constraints in the form of equalities and inequalities constitute the vast majority of proof obligations that arise in embedded applications of theorem proving such as extended typechecking, software and hardware verification, and compiler optimization. Such constraints involve the ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
the conjunction of equalities, inequalities, and disequalities over arithmetic, uninterpreted functions, and other datatypes. In this setting, the constraint solving procedure must be incremental while yielding equality information. The usual methods of solving linear arithmetic constraints are based on Fourier
EnergyAware Mapping for Tilebased NoC Architectures under Performance Constraints
, 2003
"... In this paper, we present an algorithm which automatically maps the IPs/cores onto a generic regular Network on Chip (NoC) architecture such that the total communication energy is minimized. At the same time, the performance of the mapped system is guaranteed to satisfy the specified constraints thr ..."
Abstract

Cited by 129 (5 self)
 Add to MetaCart
In this paper, we present an algorithm which automatically maps the IPs/cores onto a generic regular Network on Chip (NoC) architecture such that the total communication energy is minimized. At the same time, the performance of the mapped system is guaranteed to satisfy the specified constraints
Solving Difference Constraints Incrementally
, 1995
"... ... In this paper, we explore the problem of maintaining a solution to a system of difference constraints as the system undergoes changes such as the addition or removal of constraints. The problem arises in the context of an interactive system that allows users to model the temporal behavior of a m ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
multimedia application as a system of difference constraints. We present an incremental algorithm for the problem (which enables immediate feedback to the user as and when a constraint added or modified by the user creates an infeasible system.) Our algorithm processes the addition of a constraint in time O
Results 1  10
of
1,082