3946 search results - page 82 / 790 » The computational complexity of choice sets |
116
click to vote
DSS
2002
14 years 11 months ago
2002
Recent research has sought to develop formal languages for business communication as more expressive, flexible and powerful alternatives to current electronic data interchange (ED...
106
click to vote
EVOW
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we introduce an hybrid evolutionary algorithm for computer-aided orchestration. Our current approach to orchestration consists in replicating a target sound with a se...
TAMC
2009
Springer
15 years 6 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
105
click to vote
STOC
2010
ACM
15 years 4 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
IFSA
2007
Springer
15 years 6 months ago
2007
Springer
Disruption on a supply chain provokes lost that should be minimized looking for alternative suppliers. This solution involves a strategy to manage the impact of the disruption and ...