Sciweavers

3433 search results - page 136 / 687
» Heuristics for a bidding problem
Sort
View
WG
1998
Springer
15 years 10 months ago
Graphs with Bounded Induced Distance
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
Serafino Cicerone, Gabriele Di Stefano
DKE
2006
70views more  DKE 2006»
15 years 6 months ago
Merging news reports that describe events
Many kinds of news report provide information about events. For example, business news reports in the area of mergers and acquisitions, provide information about events such as &q...
Anthony Hunter, Rupert Summerton
CN
2007
111views more  CN 2007»
15 years 6 months ago
An auction mechanism for allocating the bandwidth of networks to their users
We present a mechanism for auctioning bandwidth on a network-wide basis to end users or ISPs that will utilize it for the same time period. This mechanism consists of a set of sim...
Manos Dramitinos, George D. Stamoulis, Costas Cour...
AAAI
2008
15 years 8 months ago
Planning with Problems Requiring Temporal Coordination
We present the first planner capable of reasoning with both the full semantics of PDDL2.1 (level 3) temporal planning and with numeric resources. Our planner, CRIKEY3, employs heu...
Andrew Coles, Maria Fox, Derek Long, Amanda Smith
BIRTHDAY
2006
Springer
15 years 10 months ago
Searching in a Maze, in Search of Knowledge: Issues in Early Artificial Intelligence
Abstract. Heuristic programming was the first area in which AI methods were tested. The favourite case-studies were fairly simple toyproblems, such as cryptarithmetic, games, such ...
Roberto Cordeschi