|
|
BCDXBOX360 wrote: vision by machines seems 2 lag behind the simplest animal u can think of (like a cat or something else).
I doubt that a cat qualifies as the simplest animal I can think of; besides, if they had such a simple visual system, they wouldn't probably be the formidable predators that they are....
|
|
|
|
|
sgorozco wrote: I doubt that a cat qualifies as the simplest animal I can think of; besides, if
they had such a simple visual system, they wouldn't probably be the formidable
predators that they are....
You are right cats are not the simplest animals. But "simple" in this context is a relative measure (let's say relative to computer/machine vision potential) and that computers of today are capable of running a vision system advanced enough to make a cat look like a cockroach but no such vision system exists because there are'nt many efforts to do that as many people like doing the easy stuff.
|
|
|
|
|
Just like the title says, is there any particular way to increase the efficiency or speed of genetic algorithm?
Right now I'm designing a Ship parking scheduler? (I dunno what should I named it with). Basically, There's 5 or more dock and a bunch of ships, and I have to find the best combination (each ship have different length and park-cost).
Excuse me for my improper grammar and typos.
It's because English is my primary language, not my first language.
My first languages are C# and Java.
VB, ASP, JS, PHP and SQL are my second language.
Indonesian came as my third language.
My fourth language? I'm still creating it, I'll let you know when it's done! 
|
|
|
|
|
The surest way to improve a genetic algorithm's performance is to increase the population size, but this also takes more time.
You could try increasing the selection bias for the following generation, e.g. weight your evaluation function so that the most-fit schedules have a probability of being selected 5X the less-fit schedules. This will result in the following generation having a higher proportion of more-fit genes, which will converge faster.
|
|
|
|
|
That doesn't really sound like an ideal problem for a GA to me, unless what you're evolving is the metadata that seeds the algorithm that chooses which ships to take next. Too many of the mutations or crossovers will result in invalid parking configurations if you're trying to map genes directly to ships.
A GA is generally a tradeoff between variety and speed. You can make it go faster by having a smaller population, or by stronger selection pressure (more brutally killing off lower fitness solutions), but in either case you are reducing the gene pool and might therefore miss the variety you need to jump out of a local minimum.
|
|
|
|
|
Free Laptop for 4 months directly to your home. Just enter your postal code to see if you qualify and provide your shipping information here https://www.freeaaronslaptop.com/
|
|
|
|
|
Firo Atrum Ventus wrote: what should I named it with
While I can't help you with the GA question, sorry, I do have long experience creating names for technical products, designing logos, and designing and writing technical copy for oem's, vars, developers, and end-users, etc.
My suggestions for the name of your "docking optimizer" are:
DockRight
RightDock
DockRite
RiteDock
DockSnug
SnugDock
PentaDock
 => absurd category :
RockinDockin
DockSnuggler
SnuggleUpRight
In all of the above, consider omitting the letter "k" from "dock."
best, Bill
"I have always wished for my computer to be as easy to use as my telephone; my wish has come true because I can no longer figure out how to use my telephone." Bjarne Stroustrop circa 1990
|
|
|
|
|
I have a datatable like below
<pre lang="text">
Employee Salary
--------------------------
Emp A 1000
Emp B 500
Emp C 3000
Emp D 3000
Emp E 200
Emp F 100
Emp G 200
Emp H 500
Emp I 1450</pre>
I want minimum number of groups, Sum of Salary in one group should not exceed 5000. So my final output should be like this
<pre lang="text">
Employee Salary Group
-------------------------------------
Emp A 1000 Group 1
Emp B 500 Group 1
Emp C 3000 Group 1
Emp E 200 Group 1
Emp F 100 Group 1
Emp G 200 Group 1
Emp D 3000 Group 2
Emp H 500 Group 2
Emp I 1450 Group 2
</pre>
|
|
|
|
|
This question was already posted in Q&A[^]; please post in one location only.
0100000101101110011001000111001011101001
|
|
|
|
|
|
I want implement polygon in c# using visual studio.Its one task of Google map part of my project.plz guide me.I have already done in c programing language using graphics function,is this similar for C#???
|
|
|
|
|
|
WITH OUT STATIC IP REMOTE COMPUTER USING PROGRAM FOR VB.NET
|
|
|
|
|
1) Please don't shout
2) Submit a specific problem, expose what you have done, what you expect and what you actually get.
Again, this forum is not here to do your work ; it is here to help on specific subjects/problems.
If you don't take the time to analyze your requirements by yourself, how do you expect we will do it for you ?
modified 7-Oct-11 6:33am.
|
|
|
|
|
i have always thought VB programmers are slightly Dim 
|
|
|
|
|
Hello Everybody,
I have a network and I want to find diffrent and multiple paths in this network.
I have try dfs ,bfs, aco but still they are getting only one solution.
so pls help.
Thanks
If you can think then I Can.
|
|
|
|
|
Then there is only one solution, or an error in your algorithms. DFS and BFS, if run to completion, will find all the paths.
|
|
|
|
|
how to write codings for sram by using enhanced canary based system for power reduction
|
|
|
|
|
|
Possibly by reading some of the journals listed here[^].
|
|
|
|
|
Wibble hatstand?
Panic, Chaos, Destruction. My work here is done.
Drink. Get drunk. Fall over - P O'H
OK, I will win to day or my name isn't Ethel Crudacre! - DD Ethel Crudacre
I cannot live by bread alone. Bacon and ketchup are needed as well. - Trollslayer
Have a bit more patience with newbies. Of course some of them act dumb - they're often *students*, for heaven's sake - Terry Pratchett
|
|
|
|
|
|
how to write c codings for ant colony algorithm by using floorplanning
|
|
|
|
|
You could start by checking out Google.[^]
It's truly amazing what information can be found.
I wasn't, now I am, then I won't be anymore.
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
