9842 search results - page 1592 / 1969 » The Complexity of the Matching-Cut Problem |
206
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—Network coding is emerging as a promising alternative to traditional content distribution approaches in P2P networks. By allowing information mixture in peers, it simpli...
181
click to vote
LICS
2008
IEEE
16 years 1 months ago
2008
IEEE
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
183
click to vote
SP
2008
IEEE
16 years 1 months ago
2008
IEEE
Automata-based representations and related algorithms have been applied to address several problems in information security, and often the automata had to be augmented with additi...
195
click to vote
GECCO
2007
Springer
16 years 28 days ago
2007
Springer
An agent population can be evolved in a complex environment to perform various tasks and optimize its job performance using Learning Classifier System (LCS) technology. Due to the...
187
click to vote
TAMC
2007
Springer
16 years 26 days ago
2007
Springer
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...