Carefully choose the position and angle of two ball, and listen!
On 6/14/06, Burak Durmuş <[EMAIL PROTECTED]> wrote:
i couldn't solve 2nd puzzle.
what am i missing?
2006/6/13, Feng <[EMAIL PROTECTED]>:
beautiful!
But the later puzzles is not as difficult as expected. Maybe the mode of incr
fireblade wrote:
> I have implementation of A* using Binary heaps, and as usually
> everything is good untill I need to update elemt in the middle
> of the heap?
> Anybody has a good algorithm of doing this efficiently/
> thanks
> bobi
Sounds like you are looking for what some authors call an
in
fireblade wrote:
> Thank you very much.
> Is there also anything for finding node in a heap
> per given key?
Not with a binary heap. If you need a Find operation, you can use a
balanced BST (or perhaps a splay tree). This requires O(log n) to
insert rather than O(1) as for the binary heap and
Hi for all.
I want to do a generator for this game, but I don´t know what theory
could I used to do a optimal generator.
I want to generate instances in incresing order of dificult, using
certains restrictions, like the number o vertex in the graph
The Description of the game is at:
http://www
Thank you very much.
Is there also anything for finding node in a heap
per given key?
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegro
Nat (Padmanabhan Natarajan) wrote:
> is the flag := true equvilanet to Test & Set instruction? That is, can we
> assume that setting/unsetting the flag is an atomic operation?
since it is a single command, I assume that, yes, it is atomic.
Thanks !
>
> On 6/14/06, Dan Ulman <[EMAIL PROTECTED]> w
i couldn't solve 2nd puzzle.
what am i missing?
2006/6/13, Feng <[EMAIL PROTECTED]>:
beautiful!
But the later puzzles is not as difficult as expected. Maybe the mode of increasing difficulty is better.
Regards
On 6/6/06, Abhi <[EMAIL PROTECTED]> wrote:
http://fizzlebot.com/cdt2.php
--~-
is the flag := true equvilanet to Test & Set instruction? That is, can we assume that setting/unsetting the flag is an atomic operation?On 6/14/06, Dan Ulman
<[EMAIL PROTECTED]> wrote:Hi ! Can you please help me with the following ?
Let A be an arbitrary deadlock-free mutual exclusion algorithm in
Hi, I always wondered this after the examination results were out in
the internet, what if i put all the roll numbers and get all
information about everyone who have passed the examination, and see
for myself as who stood first at the exam. I wondered this after
getting the CA exam results, and h
