81 results found displaying 52-54
    
socratesOne
 USA
MMPORPG for education Printer Friendly Version
An MMPORPG (Massive Multiplayer Online Role Playing Game) for eduational use.
A role playing game usually consists of doing something (hunting monsters, casting spells, etc...) in order to gain "experience points". With those "experience points", you are able to defeat bigger monsters, travel to distant places, etc...
Well, how about the same thing, only, instead of killing monsters, you would have to figure out problems (quest-based). With each problem solved, you could get rewards such as money or XP, which you can use to purchase vehicles or equipment.
Reward: PLEASE let me know if you are interested in collaborating with me on this project. We could start a new project at sourceforge. 

There are 9 replies to this idea



Want to use this idea? Check out the Site Concept as well as the Site Rules.
51°

    
socratesOne
 USA
Recipe Database based on supply of ingredients. Printer Friendly Version
An online recipes website, that allows you to search for recipes based on ingredients. Not main ingredients, like most recipe sites, but ALL ingredients.
In other words, I would log onto the site, enter in what I have in the fridge and in the cupboard (store the info in a database so I don't have to add it every time), and then look for what I can cook. I would only see recipes that I would be able to make at that moment with the ingredients I allready have.
Reward: Inform me about it. 

There are 14 replies to this idea

Want to use this idea? Check out the Site Concept as well as the Site Rules.
65°

    
HenrykGerlach
 Germany
Serial bid algorithm Printer Friendly Version
1. The Problem - If you want to buy an item, which is offered several times in (internet-)auctions and you want to pay a finite maximum price, then you have to bid for each offer separately until you suceed buying at your maximum price or lower. This is unpleasant.
2. The Solution - Order the auctions you are interested in in a list I (the auction, that will finish soonest, first) and mark some maximum price p_I for the list. Now an (computerized) agent might bid for the first item on the list until it wins the auction or the maximum price p_I is surpassed. In the first case, you got your item and the agent drops your list and stops bidding. In the second case, the agent drops the first item from your list and continues to bid for the rest of the list.
By that, you either win exactly one item from your list, or all items are sold above your maximum price.
I call this serial bid.
Reward: Dedicate one of your patents if you have any. 

There are 5 replies to this idea



Want to use this idea? Check out the Site Concept as well as the Site Rules.
12°

Results are currently sorted by "newest". Click here to see the hottest ideas first.
OFFSHORE