450 search results - page 89 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
174
click to vote
EH
1999
IEEE
1999
IEEE
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
15 years 2 months ago
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
NIPS
2003
14 years 11 months ago
2003
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
DEBS
2008
ACM
14 years 11 months ago
2008
ACM
In this effort we tackle the important issue of providing Quality of Service (QoS) guarantees to subscribers, when routing event notifications in a publish-subscribe domain. In ...
TPLP
2002
14 years 9 months ago
2002
In this paper, we consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics. In this approach, new informat...
ESA
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...