Sciweavers

1278 search results - page 235 / 256
» Programming Sensor Networks Using Abstract Regions
Sort
View
124
Voted
MP
2011
14 years 6 months ago
Implicit solution function of P0 and Z matrix linear complementarity constraints
Abstract. Using the least element solution of the P0 and Z matrix linear complementarity problem (LCP), we define an implicit solution function for linear complementarity constrai...
Xiaojun Chen, Shuhuang Xiang
131
Voted
CPAIOR
2009
Springer
15 years 10 months ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin
120
Voted
ICCAD
1995
IEEE
144views Hardware» more  ICCAD 1995»
15 years 7 months ago
Background memory management for dynamic data structure intensive processing systems
Abstract -- Telecommunication network management applications often require application-specific ICs that use large dynamically allocated stored data structures. Currently availab...
Gjalt G. de Jong, Bill Lin, Carl Verdonck, Sven Wu...
DAC
2002
ACM
16 years 4 months ago
Dynamic hardware plugins in an FPGA with partial run-time reconfiguration
Tools and a design methodology have been developed to support partial run-time reconfiguration of FPGA logic on the Field Programmable Port Extender. High-speed Internet packet pr...
Edson L. Horta, John W. Lockwood, David E. Taylor,...
114
Voted
IANDC
2008
84views more  IANDC 2008»
15 years 3 months ago
A theory of system behaviour in the presence of node and link failure
We develop a behavioural theory of distributed programs in the presence of failures such as nodes crashing and links breaking. The framework we use is that of D, a language in whi...
Adrian Francalanza, Matthew Hennessy