Country: United States

Found 17049 papers in total
Axiomatization of the nucleolus
Axiomatization of the nucleolus
1995,
An axiomatization of the nucleolus on the set of all cooperative games with finite...
Canonical representation of set-functions
Canonical representation of set-functions
1995,
The representation of a cooperative transferable utility game as a linear combination...
Harvest scheduling with area-based adjacency constraints
Harvest scheduling with area-based adjacency constraints
2002,
Adjacency constraints in harvest scheduling models prevent the harvest of adjacent...
Solvability of 2-player game forms with infinite sets of strategies
Solvability of 2-player game forms with infinite sets of strategies
1995,
A game form is N-solvable for a class of payoff functions, if for every pair of payoff...
Applying fuzzy logic to tree bucking control
Applying fuzzy logic to tree bucking control
2002,
In this article, we introduce a fuzzy logic based control system that calibrates the...
An online algorithm for the dynamic maximal dense tree problem
An online algorithm for the dynamic maximal dense tree problem
2002,
The Online Maximal Dense Tree problem is as follows: given a weighted directed graph...
Scale and unit specification influences in harvest scheduling with maximum area restrictions
Scale and unit specification influences in harvest scheduling with maximum area restrictions
2002,
This article examines alternative approaches for representing a forest region to be...
Approximations for a bottleneck Steiner tree problem
Approximations for a bottleneck Steiner tree problem
2002,
In the design of wireless communication networks, due to a budget limit, suppose we...
An indirect search algorithm for harvest-scheduling under adjacency constraints
An indirect search algorithm for harvest-scheduling under adjacency constraints
2003,
An indirect search heuristic is described for solving harvest-scheduling problems...
Experimental analysis of heuristic algorithms for the dominating set problem
Experimental analysis of heuristic algorithms for the dominating set problem
2002,
We say a vertex upsilon in a graph G covers a vertex omega if upsilon = omega or if...
An integer programming model to optimize resource allocation for wildfire containment
An integer programming model to optimize resource allocation for wildfire containment
2003,
Determining the specific mix of fire-fighting resources for a given fire is a...
Exact and approximation algorithms for clustering
Exact and approximation algorithms for clustering
2002,
In this paper we present an n(O(k1 − 1/d)) -time algorithm for solving the k...
Timber harvesting as a part of the portfolio management: A multiperiod stochastic optimisation approach
Timber harvesting as a part of the portfolio management: A multiperiod stochastic optimisation approach
2003,
A multiperiod stochastic optimization model is formulated for a land owner who can...
Budget management with applications
Budget management with applications
2002,
Given a directed acyclic graph with timing constraints, the budget management problem...
Swapping a failing edge of a single source shortest paths tree is good and fast
Swapping a failing edge of a single source shortest paths tree is good and fast
2003,
Let G = (V, E) be a 2-edge connected, undirected and nonnegatively weighted graph, and...
Cascade graphs: Design, analysis and algorithms for relational joins
Cascade graphs: Design, analysis and algorithms for relational joins
2001,
The focus of this work is on join optimization in relational database systems. The...
A hybrid GRASP with perturbations for the Steiner problem in graphs
A hybrid GRASP with perturbations for the Steiner problem in graphs
2002,
We propose and describe a hybrid GRASP with weight perturbations and adaptive...
The bounded cycle-cover problem
The bounded cycle-cover problem
2001,
We consider the bounded cycle-cover problem, which is to find a minimum cost cycle...
On the design problem of multitechnology networks
On the design problem of multitechnology networks
2001,
In this article we propose a model for the topological design problem of...
Routing flow through a strongly connected graph
Routing flow through a strongly connected graph
2002,
It is shown that, for every strongly connected network in which every edge has...
Packing spanning-trees
Packing spanning-trees
1995,
We are given an algorithm for packing spanning trees in a graph G = (V, E), with...
Ensembling neural networks: Many could be better than all
Ensembling neural networks: Many could be better than all
2002,
Neural network ensemble is a learning paradigm where many neural networks are jointly...
The analysis of evolutionary algorithms – A proof that crossover really can help
The analysis of evolutionary algorithms – A proof that crossover really can help
2002,
Evolutionary algorithms are randomized search heuristics that were invented in the...
Innovation and strategic divergence: An empirical study of the US pharmaceutical industry from 1920 to 1960
Innovation and strategic divergence: An empirical study of the US pharmaceutical industry from 1920 to 1960
2003,
Today, firms employing two distinct survival strategies – (1) innovation and (2)...
Papers per page: