26354 search results - page 324 / 5271 » How we refactor, and how we know it |
134
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
We discuss how the runtime of SVM optimization should decrease as the size of the training data increases. We present theoretical and empirical results demonstrating how a simple ...
160
click to vote
CADE
2005
Springer
16 years 7 months ago
2005
Springer
We introduce XOR constraints, and show how they enable a theorem prover to reason effectively about security critical subsystems which employ bitwise XOR. Our primary case study is...
209
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we survey some results in inductive inference showing how learnability of a class of languages may depend on hypothesis space chosen. We also discuss results which co...
144
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— In this paper we illustrate how sensitivities can be used to provide a practical precursor to dynamic transitions and numerical uncertainty in parameterized nonlinear parabolic...
156
click to vote
CISIS
2008
IEEE
16 years 1 months ago
2008
IEEE
Currently, we are developing an agent-team based infrastructure for resource brokering and management in Grids. In this note we consider how team is supervised and how mirroring c...