Sciweavers

1884 search results - page 70 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
STACS
1994
Springer
15 years 2 months ago
On the Complexity of the Maximum Cut Problem
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
Hans L. Bodlaender, Klaus Jansen
AAAI
1994
14 years 11 months ago
Automated Modeling for Answering Prediction Questions: Selecting the Time Scale and System Boundary
The ability to answer prediction questions is crucial to reasoning about physical systems. A prediction question poses a hypothetical scenario and asks for the resulting behavior ...
Jeff Rickel, Bruce W. Porter
TMI
2008
67views more  TMI 2008»
14 years 10 months ago
A Fast Method for Designing Time-Optimal Gradient Waveforms for Arbitrary k-Space Trajectories
A fast and simple algorithm for designing time-optimal waveforms is presented. The algorithm accepts a given arbitrary multi-dimensional k-space trajectory as the input and outputs...
Michael Lustig, Seung-Jean Kim, John M. Pauly
NOSSDAV
2005
Springer
15 years 3 months ago
MOPAR: a mobile peer-to-peer overlay architecture for interest management of massively multiplayer online games
In this paper we propose a fully distributed peer-to-peer (P2P) infrastructure supporting Networked Virtual Environment (NVE) applications, such as massively multiplayer online ga...
Anthony (Peiqun) Yu, Son T. Vuong
ORL
2007
112views more  ORL 2007»
14 years 9 months ago
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
We analyze a simple and natural on-line algorithm (dispatch policy) for a dynamic multiperiod uncapacitated routing problem, in which at the beginning of each time period a set of...
Enrico Angelelli, Martin W. P. Savelsbergh, Maria ...