5372 search results - page 407 / 1075 » complexity 2007 |
148
click to vote
ATAL
2007
Springer
16 years 29 days ago
2007
Springer
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. W...
170
click to vote
ESA
2007
Springer
16 years 28 days ago
2007
Springer
It is well known that n integers in the range [1, nc ] can be sorted in O(n) time in the RAM model using radix sorting. More generally, integers in any range [1, U] can be sorted i...
157
click to vote
FSTTCS
2007
Springer
16 years 28 days ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
177
click to vote
ICANNGA
2007
Springer
15 years 10 months ago
2007
Springer
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
170
click to vote
WSC
2007
15 years 9 months ago
2007
This paper describes an innovative framework, iFAOSimo, which integrates optimization, simulation and GIS (geographic information system) techniques to handle complex spatial faci...