6456 search results - page 332 / 1292 » Constraint Solving on Terms |
191
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we propose a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is ext...
172
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
158
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...
184
click to vote
ICC
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— This paper is concerned with the end-to-end transmission outage in an OFDM based wireless multi-hop network. The network consists of a source node, a destination node, ...
185
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...