Sciweavers

10718 search results - page 366 / 2144
» On the Circuit Implementation Problem
Sort
View
PARA
2004
Springer
16 years 5 days ago
A Domain Theoretic Account of Euler's Method for Solving Initial Value Problems
Abstract. This paper presents a method of solving initial value problems using Euler’s method, based on the domain of interval valued functions of a real variable. In contrast to...
Abbas Edalat, Dirk Pattinson
ICLP
1999
Springer
15 years 11 months ago
Finding Fair Allocations for the Coalition Problem with Constraints
Fair allocation of payoffs among cooperating players who can form various coalitions of differing utilities is the classic game theoretic “coalition problem.” Shapley’s va...
Evan Tick, Roland H. C. Yap, Michael J. Maher
ESA
2007
Springer
122views Algorithms» more  ESA 2007»
15 years 10 months ago
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...
Cristina Bazgan, Hadrien Hugot, Daniel Vanderpoote...
GCB
2000
Springer
75views Biometrics» more  GCB 2000»
15 years 10 months ago
Regexpcount, a Symbolic Package for Counting Problems on Regular Expressions and Words
In previous work [10], we considered algorithms related to the statistics of matches with words and regular expressions in texts generated by Bernoulli or Markov sources. In this w...
Pierre Nicodème
NIPS
2001
15 years 8 months ago
A Parallel Mixture of SVMs for Very Large Scale Problems
Support Vector Machines (SVMs) are currently the state-of-the-art models for many classication problems but they suer from the complexity of their training algorithm which is at l...
Ronan Collobert, Samy Bengio, Yoshua Bengio