1940 search results - page 217 / 388 » Graph Transformation with Variables |
122
click to vote
SIGSOFT
2006
ACM
16 years 4 months ago
2006
ACM
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
122
click to vote
ICTAI
2009
IEEE
15 years 10 months ago
2009
IEEE
Energy-based learning (EBL) is a general framework to describe supervised and unsupervised training methods for probabilistic and non-probabilistic factor graphs. An energy-based ...
135
click to vote
ICMCS
2005
IEEE
15 years 9 months ago
2005
IEEE
We consider the problem of packetizing a variable length coded Markov sequence into fixed length packets, while being protected by variable rate channel code. Given the total tra...
145
Voted
LICS
2005
IEEE
15 years 9 months ago
2005
IEEE
We provide a uniform solution to the problem of synthesizing a finite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...
129
Voted
SAT
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...