3637 search results - page 603 / 728 » On Dynamic Bit-Probe Complexity |
103
click to vote
IJCAI
2007
14 years 11 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
105
click to vote
IJCAI
2007
14 years 11 months ago
2007
Recently, significant progress has been made on learning structured predictors via coordinated training algorithms such as conditional random fields and maximum margin Markov ne...
NETWORKING
2008
14 years 11 months ago
2008
In the highly dynamic and unpredictable environment of MANETs, cross-layer design is receiving growing interest but lacks experimental validation tools. This paper presents XIAN (C...
NIPS
2008
14 years 11 months ago
2008
With the increased availability of data for complex domains, it is desirable to learn Bayesian network structures that are sufficiently expressive for generalization while at the ...
IPCO
2007
14 years 11 months ago
2007
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...