3250 search results - page 191 / 650 » Parameterized Learning Complexity |
170
click to vote
AAAI
2004
15 years 8 months ago
2004
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...
203
click to vote
CASCON
2004
15 years 8 months ago
2004
Previous research shows that most software systems contain significant amounts of duplicated, or cloned, code. Some clones are exact duplicates of each other, while others differ ...
157
click to vote
FORTE
2004
15 years 8 months ago
2004
Abstract. We propose a framework for intrusion detection that is based on runtime monitoring of temporal logic specifications. We specify intrusion patterns as formulas in an expre...
179
click to vote
MMNS
2003
15 years 7 months ago
2003
We propose a lightweight traffic admission control scheme based on on-line monitoring which ensures multimedia services quality both intra-domain and end-to-end. The AC strategy i...
191
click to vote
TCOM
2008
15 years 6 months ago
2008
The constellation design for differential space-time modulation usually requires to construct L (constellation size) unitary matrices making the design complexity increasing rapidl...