4345 search results - page 207 / 869 » Temporal Constraint Networks |
138
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
157
Voted
MP
2011
14 years 9 months ago
2011
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...
196
click to vote
INFOCOM
2011
IEEE
14 years 9 months ago
2011
IEEE
—Modern networks are complex and hence, network operators often rely on automation to assist in assuring the security, availability, and performance of these networks. At the cor...
198
click to vote
SCP
1998
15 years 5 months ago
1998
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
167
click to vote
ESAS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. One of the most frequent operations in modern cryptosystems is a multi-scalar multiplication with two scalars. Common methods to compute it are the Shamir method and the ...