1449 search results - page 3 / 290 » Self-Randomized Exponentiation Algorithms |
104
click to vote
JMLR
2008
14 years 9 months ago
2008
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
ITIIS
2010
14 years 4 months ago
2010
IEEE 802.11 medium access control (MAC) employs the distributed coordination function (DCF) as the fundamental medium access function. DCF operates with binary exponential backoff...
80
Voted
GECCO
2000
Springer
15 years 1 months ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
IJCAI
2001
14 years 11 months ago
2001
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
FSTTCS
2006
Springer
15 years 1 months ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...