Sciweavers

16430 search results - page 3248 / 3286
» On Computable Tree Functions
Sort
View
CSDA
2007
105views more  CSDA 2007»
13 years 7 months ago
Model selection for support vector machines via uniform design
The problem of choosing a good parameter setting for a better generalization performance in a learning task is the so-called model selection. A nested uniform design (UD) methodol...
Chien-Ming Huang, Yuh-Jye Lee, Dennis K. J. Lin, S...
JAIR
2006
134views more  JAIR 2006»
13 years 7 months ago
Multi-Issue Negotiation with Deadlines
This paper studies bilateral multi-issue negotiation between self-interested autonomous agents. Now, there are a number of different procedures that can be used for this process; ...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
JPDC
2008
134views more  JPDC 2008»
13 years 7 months ago
Middleware for data mining applications on clusters and grids
This paper gives an overview of two middleware systems that have been developed over the last 6 years to address the challenges involved in developing parallel and distributed imp...
Leonid Glimcher, Ruoming Jin, Gagan Agrawal
JUCS
2008
194views more  JUCS 2008»
13 years 7 months ago
An Application of Meta Search Agent System Based on Semantized Tags for Enhanced Web Searching
: Web searching techniques have been investigated and implemented in many aspects. Particularly, in case of personalization, more important issue is how to manipulate the results r...
Chonggun Kim, JaeYoun Jung, Hyeon-Cheol Zin, Jason...
ECCC
2007
90views more  ECCC 2007»
13 years 7 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
« Prev « First page 3248 / 3286 Last » Next »