9842 search results - page 1419 / 1969 » The Complexity of the Matching-Cut Problem |
182
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
231
click to vote
ICCAD
2002
IEEE
16 years 4 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
207
click to vote
WISEC
2009
ACM
16 years 1 months ago
2009
ACM
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
192
click to vote
ESA
2009
Springer
16 years 1 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...
169
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
A recent theoretical investigation of modular representations shows that certain modularizations can introduce a distance bias into a landscape. This was a static analysis, and em...