Search Results

Search found 29603 results on 1185 pages for 'search path'.

Page 92/1185 | < Previous Page | 88 89 90 91 92 93 94 95 96 97 98 99  | Next Page >

• "Search Friendly" domain names

  - by Ben

  We bought a few search friendly domain names for the CPA site that I manage. Each of the domains we bought has the name of a nearby city and the word cpa in front of, or behind the city name. The plan is to create a landing page for each of these domains with useful information about business filings, ect. specific to that city, as well as directions to our office from that city. The question is how to best utilize these new domains: Should each domain be set to a 301 redirect to mainsite.com/city ? Should each domain be it's own single page mini-site that links to mainsite.com ? What other options are there and what are the pros/cons? Remember the goal is to be more relevant in searches that use a nearby city name in their search for CPA/accounting services.

  Read the article

• Tool for creating complex paths?

  - by TerryB

  I want to create some fairly complex predefined paths for my AI sprites to follow. I'll need to use curves, splines etc to get the effect I want. Is there a drawing tool out there that will allow me to draw such curves, "mesh" them by placing lots of points along them at some defined density and then output the coordinates of all of those points for me? I could write this tool myself but hopefully one of the drawing packages can do this? Cheers!

  Read the article

• inverse search from Okular to Kile

  - by shallowthought

  Upgraded to 12:04 now can't get inverse search to work (from Okular to Kile) My settings: in Kile I have: Tools - Mode - Normal in Okular I have: Settings- Configure-Editor (and set Editor to Kile) In Kile I have tried the buttons: PDFLatex and then ForwardPDF and also: Latex and then ForwardPDF. both bring up PDF in Okular, but SHIFT/leftClick does not do an inverse search. A bug in Kile? in Okular? in 12.04? in me? I'm using a System76 Pangolin P8. Thanks for any help

  Read the article

• Pathfinding in multi goal, multi agent environment

  - by Rohan Agrawal

  I have an environment in which I have multiple agents (a), multiple goals (g) and obstacles (o). . . . a o . . . . . . . o . g . . a . . . . . . . . . . o . . . . o o o o . g . . o . . . . . . . o . . . . o . . . . o o o o a What would an appropriate algorithm for pathfinding in this environment? The only thing I can think of right now, is to Run a separate version of A* for each goal separately, but i don't think that's very efficient.

  Read the article

• Wikipedia A* pathfinding algorithm takes a lot of time

  - by Vee

  I've successfully implemented A* pathfinding in C# but it is very slow, and I don't understand why. I even tried not sorting the openNodes list but it's still the same. The map is 80x80, and there are 10-11 nodes. I took the pseudocode from here Wikipedia And this is my implementation: public static List<PGNode> Pathfind(PGMap mMap, PGNode mStart, PGNode mEnd) { mMap.ClearNodes(); mMap.GetTile(mStart.X, mStart.Y).Value = 0; mMap.GetTile(mEnd.X, mEnd.Y).Value = 0; List<PGNode> openNodes = new List<PGNode>(); List<PGNode> closedNodes = new List<PGNode>(); List<PGNode> solutionNodes = new List<PGNode>(); mStart.G = 0; mStart.H = GetManhattanHeuristic(mStart, mEnd); solutionNodes.Add(mStart); solutionNodes.Add(mEnd); openNodes.Add(mStart); // 1) Add the starting square (or node) to the open list. while (openNodes.Count > 0) // 2) Repeat the following: { openNodes.Sort((p1, p2) => p1.F.CompareTo(p2.F)); PGNode current = openNodes[0]; // a) We refer to this as the current square.) if (current == mEnd) { while (current != null) { solutionNodes.Add(current); current = current.Parent; } return solutionNodes; } openNodes.Remove(current); closedNodes.Add(current); // b) Switch it to the closed list. List<PGNode> neighborNodes = current.GetNeighborNodes(); double cost = 0; bool isCostBetter = false; for (int i = 0; i < neighborNodes.Count; i++) { PGNode neighbor = neighborNodes[i]; cost = current.G + 10; isCostBetter = false; if (neighbor.Passable == false || closedNodes.Contains(neighbor)) continue; // If it is not walkable or if it is on the closed list, ignore it. if (openNodes.Contains(neighbor) == false) { openNodes.Add(neighbor); // If it isn’t on the open list, add it to the open list. isCostBetter = true; } else if (cost < neighbor.G) { isCostBetter = true; } if (isCostBetter) { neighbor.Parent = current; // Make the current square the parent of this square. neighbor.G = cost; neighbor.H = GetManhattanHeuristic(current, neighbor); } } } return null; } Here's the heuristic I'm using: private static double GetManhattanHeuristic(PGNode mStart, PGNode mEnd) { return Math.Abs(mStart.X - mEnd.X) + Math.Abs(mStart.Y - mEnd.Y); } What am I doing wrong? It's an entire day I keep looking at the same code.

  Read the article

• 2D Grid Map Connectivity Check (avoiding stack overflow)

  - by SombreErmine

  I am trying to create a routine in C++ that will run before a more expensive A* algorithm that checks to see if two nodes on a 2D grid map are connected or not. What I need to know is a good way to accomplish this sequentially rather than recursively to avoid overflowing the stack. What I've Done Already I've implemented this with ease using a recursive algorithm; however, depending upon different situations it will generate a stack overflow. Upon researching this, I've come to the conclusion that it is overflowing the stack because of too many recursive function calls. I am sure that my recursion does not enter an infinite loop. I generate connected sets at the beginning of the level, and then I use those connected sets to determine connectivity on the fly later. Basically, the generating algorithm starts from left-to-right top-to-bottom. It skips wall nodes and marks them as visited. Whenever it reaches a walkable node, it recursively checks in all four cardinal directions for connected walkable nodes. Every node that gets checked is marked as visited so they aren't handled twice. After checking a node, it is added to either a walls set, a doors set, or one of multiple walkable nodes sets. Once it fills that area, it continues the original ltr ttb loop skipping already-visited nodes. I've also looked into flood-fill algorithms, but I can't make sense of the sequential algorithms and how to adapt them. Can anyone suggest a better way to accomplish this without causing a stack overflow? The only way I can think of is to do the left-to-right top-to-bottom loop generating connected sets on a row basis. Then check the previous row to see if any of the connected sets are connected and then join the sets that are. I haven't decided on the best data structures to use for that though. I also just thought about having the connected sets pre-generated outside the game, but I wouldn't know where to start with creating a tool for that. Any help is appreciated. Thanks!

  Read the article

• SEP Search Engine Placement

  - by Cory Baumer

  My employer was recently contacted by a company who convinced my employer that they could do what they called search engine placement and that they can guaranty that we will be placed on he top of googles search results. I immediately told my employer that it sounded like a scam, but I was made to contact the company regardless and investigate. The sales person insisted that SEP was different than the SEO and ad words campaigns we are already performing and that it was a cheaper way to be listed in the adwords section and that it didn't include a cost per click. It sounds to me like its kinda scammy like they are going to setup an adwords campaign and just charge us a flat rate that is higher than the cost per clicks. Has anyone heard of this and is it at all legitimate?

  Read the article

• SEO URL structure for tag search on site

  - by Theo G

  I am looking to add tags to each product on my site e.g. brown, x products under £x, second hand x, refurbished x etc. Once you click these tags it will then search for other tags that are similar. I was thinking of using a url structure of www.site.com/tags/this%is%the%tag%name and then simply have a page that shows the results of all the products with that tag. I heard a while back that google generally ignores or downgrades anything with ‘search’ in the url and was wondering if anyone had any experience with this? Also, would you say /tags/ is a pretty valid destination or is it best to break it down and add more levels e.g. /product-type/product%variation Thanks in advance!

  Read the article

• Quality Backlinks - A Key to Search Engine Optimization

  Backlinks are the links which are going to your blogs, sites or articles. Backlinks are the most important and single very significant factors to give the page rank to your site or blogs.They are great technique and way to find a proper and a decent place in the goggle or any of the major search engines. There are many other aspects of SEO but quality back links are the most appropriate way to find a great way in terms of search engine optimization. Now it is the time to take a look at the components which are very important about backlinks.

  Read the article

• How to install Visual Studio 2010 Search References and Pro Power Tools side by side

  - by Daniel Cazzulino

  The new Visual Studio 2010 Pro Power Tools bring a new Add Reference dialog that completely replaces the classic one when you click the familiar Add Reference command: It seems like a nice dialog that is more aligned with the new Add New dialog and the Extension Manager one. But for this particular case, I believe it's awfully overkill (what's the use of that right sidebar? what's the use for the categories of assemblies split between Framework and Extensions?). The (also new) Search References extension which I blogged about earlier, gives you the familiar classic dialog enhanced with the must-have Search capability:...Read full article

  Read the article

• How to debug KMail Search after upgrade

  - by Unapiedra

  I added KDE backported packages recently to gain access to a more stable version of KDevelop. However, now, Kontact/Kmail's search doesn't work anymore. Where do I start to find out what's wrong? The problem manifests itself that when in the Inbox folder, I type something in the search bar, no Emails will be shown. (Yes, searching for something where the email is definitely there.) Kubuntu 12.04 LTS. Kontact version 4.13. What I tried. akonadiconsole as suggested here. But I couldn't find a feeder as mentioned. More generally, isn't there a checklist or a general approach to debugging akonadi, nepomuk and Kontact?

  Read the article

• Complexity of defense AI

  - by Fredrik Johansson

  I have a non-released game, and currently it's only possible to play with another human being. As the game rules are made up by me, I think it would be great if new players could learn basic game play by playing against an AI opponent. I mean it's not like Tennis, where the majority knows at least the fundamental rules. On the other hand, I'm a bit concerned that this AI implementation can be quite complex. I hope you can help me with an complexity estimation. I've tried to summarize the gameplay below. Is this defense AI very hard to do? Basic Defense Game Play Player Defender can move within his land, i.e. inside a random, non-convex, polygon. This land will also contain obstacles modeled as polygons, that Defender has to move around. Player Attacker has also a land, modeled as another such polygon. Assume that Defender shall defend against Attacker. Attacker will then throw a thingy towards Defender's land. To be rewarded, Attacker wants to hit Defender's land, and Defender will want to strike away the thingy from his land before it stops to prevent Attacker from scoring. To feint Defender, Attacker might run around within his land before the throw, and based on these attacker movements Defender shall then continuously move to the best defense position within his land.

  Read the article

• Start Your Session Search: Content Catalog is Live

  - by RichSchwerin

  Untitled Document Search through nearly 300 exhibitors and 1,600 sessions across 80 tracks, plus speakers and demos With Oracle OpenWorld 2011 just 15 weeks away, Content Catalog is now available online. That means you can browse through almost 300 exhibitors and nearly 1,600 content sessions across more than 80 different tracks, along with scores of demos. Even better, you can perform keyword searches for subjects that interest you most, from Active Data Guard to ZFS (and everything in between). But wait, there's more... Speaker Catalog--a veritable Oracle Who's Who--is also live online. You can search through hundreds of speakers, with names, titles, companies, and which sessions they're presenting. Save $500: Register Today Now that you've seen all the great content and speakers lined up for Oracle OpenWorld 2011, join us in San Francisco, October 2-6. Register by the Early Bird deadline of July 29th and save $500.

  Read the article

• Kubuntu 11.10: How to remove "Search and launch"

  - by user38489

  Is it possible to remove the "Search and launch" whateveritis from my "desktop"? I've actually tried both Desktop and Netbook modes, but it stays there in both of them. I'm not afraid of editing files in the ~/.kde dir, but I would be really disappointed if this is the only way to do it. [more details/rants] I was able to wipe out several things but I've ended up with a black window that's movable (Alt-click) but not removable. Beside being surprised by the performances, I find Kubuntu extremely unfriendly, and I can't find the logic behind the items of the interface. I've tried to search for documentation, but what I've found is not updated and doesn't include the Netbook interface.

  Read the article

• How do I make A* check all diagonal and orthogonal directions?

  - by Munezane

  I'm making a turn-based tactical game and I'm trying to implement the A* algorithm. I've been following a tutorial and got to this point, but my characters can't move diagonally up and left. Can anyone help me with this? The return x and y are int pointers which the characters are using to move towards the target. void level::aStar(int startx, int starty, int targetx, int targety, int* returnx, int* returny) { aStarGridSquare* currentSquare = new aStarGridSquare(); aStarGridSquare* startSquare = new aStarGridSquare(); aStarGridSquare* targetSquare = new aStarGridSquare(); aStarGridSquare* adjacentSquare = new aStarGridSquare(); aStarOpenList.clear(); for(unsigned int i=0; i<aStarGridSquareList.size(); i++) { aStarGridSquareList[i]->open=false; aStarGridSquareList[i]->closed=false; } startSquare=getaStarGridSquare(startx, starty); targetSquare=getaStarGridSquare(targetx, targety); if(startSquare==targetSquare) { *returnx=startx; *returny=starty; return; } startSquare->CostFromStart=0; startSquare->CostToTraverse=0; startSquare->parent = NULL; currentSquare=startSquare; aStarOpenList.push_back(currentSquare); while(currentSquare!=targetSquare && aStarOpenList.size()>0) { //unsigned int totalCostEstimate=aStarOpenList[0]->TotalCostEstimate; //currentSquare=aStarOpenList[0]; for(unsigned int i=0; i<aStarOpenList.size(); i++) { if(aStarOpenList.size()>1) { for(unsigned int j=1; j<aStarOpenList.size()-1; j++) { if(aStarOpenList[i]->TotalCostEstimate<aStarOpenList[j]->TotalCostEstimate) { currentSquare=aStarOpenList[i]; } else { currentSquare=aStarOpenList[j]; } } } else { currentSquare = aStarOpenList[i]; } } currentSquare->closed=true; currentSquare->open=false; for(unsigned int i=0; i<aStarOpenList.size(); i++) { if(aStarOpenList[i]==currentSquare) { aStarOpenList.erase(aStarOpenList.begin()+i); } } for(unsigned int i = currentSquare->blocky - 32; i <= currentSquare->blocky + 32; i+=32) { for(unsigned int j = currentSquare->blockx - 32; j<= currentSquare->blockx + 32; j+=32) { adjacentSquare=getaStarGridSquare(j/32, i/32); if(adjacentSquare!=NULL) { if(adjacentSquare->blocked==false && adjacentSquare->closed==false) { if(adjacentSquare->open==false) { adjacentSquare->parent=currentSquare; if(currentSquare->parent!=NULL) { currentSquare->CostFromStart = currentSquare->parent->CostFromStart + currentSquare->CostToTraverse + startSquare->CostFromStart; } else { currentSquare->CostFromStart=0; } adjacentSquare->CostFromStart =currentSquare->CostFromStart + adjacentSquare->CostToTraverse;// adjacentSquare->parent->CostFromStart + adjacentSquare->CostToTraverse; //currentSquare->CostToEndEstimate = abs(currentSquare->blockx - targetSquare->blockx) + abs(currentSquare->blocky - targetSquare->blocky); //currentSquare->TotalCostEstimate = currentSquare->CostFromStart + currentSquare->CostToEndEstimate; adjacentSquare->open = true; adjacentSquare->CostToEndEstimate=abs(adjacentSquare->blockx- targetSquare->blockx) + abs(adjacentSquare->blocky-targetSquare->blocky); adjacentSquare->TotalCostEstimate = adjacentSquare->CostFromStart+adjacentSquare->CostToEndEstimate; //adjacentSquare->open=true;*/ aStarOpenList.push_back(adjacentSquare); } else { if(adjacentSquare->parent->CostFromStart > currentSquare->CostFromStart) { adjacentSquare->parent=currentSquare; if(currentSquare->parent!=NULL) { currentSquare->CostFromStart = currentSquare->parent->CostFromStart + currentSquare->CostToTraverse + startSquare->CostFromStart; } else { currentSquare->CostFromStart=0; } adjacentSquare->CostFromStart =currentSquare->CostFromStart + adjacentSquare->CostToTraverse;// adjacentSquare->parent->CostFromStart + adjacentSquare->CostToTraverse; //currentSquare->CostToEndEstimate = abs(currentSquare->blockx - targetSquare->blockx) + abs(currentSquare->blocky - targetSquare->blocky); //currentSquare->TotalCostEstimate = currentSquare->CostFromStart + currentSquare->CostToEndEstimate; adjacentSquare->CostFromStart = adjacentSquare->parent->CostFromStart + adjacentSquare->CostToTraverse; adjacentSquare->CostToEndEstimate=abs(adjacentSquare->blockx - targetSquare->blockx) + abs(adjacentSquare->blocky - targetSquare->blocky); adjacentSquare->TotalCostEstimate = adjacentSquare->CostFromStart+adjacentSquare->CostToEndEstimate; } } } } } } } if(aStarOpenList.size()==0)//if empty { *returnx =startx; *returny =starty; return; } else { for(unsigned int i=0; i< aStarOpenList.size(); i++) { if(currentSquare->parent==NULL) { //int tempX = targetSquare->blockx; //int tempY = targetSquare->blocky; *returnx=targetSquare->blockx; *returny=targetSquare->blocky; break; } else { currentSquare=currentSquare->parent; } } } }

  Read the article

• Search Google Books with the Zend Framework's Zend_Gdata Component

  Learn how to search Google's vast books database using the Zend Framework's powerful Zend_Gdata comp ...

  Read the article

• Search Google Books with the Zend Framework's Zend_Gdata Component

  Learn how to search Google's vast books database using the Zend Framework's powerful Zend_Gdata comp ...

  Read the article

• How can I plot a radius of all reachable points with pathfinding for a Mob?

  - by PugWrath

  I am designing a tactical turn based game. The maps are 2d, but do have varying level-layers and blocking objects/terrain. I'm looking for an algorithm for pathfinding which will allow me to show an opaque shape representing all of the possible max-distance pixels that a mob can move to, knowing the mob's max pixel distance. Any thoughts on this, or do I just need to write a good pathfinding algorithm and use it to find the cutoff points for any direction in which an obstacle exists?

  Read the article

• Dynamic navigation mesh changes

  - by Nairou

  I'm currently trying to convert from grids to navigation meshes for pathfinding, since grids are either too coarse for accurate navigation, or too fine to be useful for object tracking. While my map is fairly static, and the navigation mesh could be created in advance, this is somewhat of a tower defense game, where objects can be placed to block paths, so I need a way to recalculate portions of the navigation mesh to allow pathing around them. Is there any existing documentation on good ways to do this? I'm still very new to navigation meshes, so the prospect of modifying them to cut or fill holes sounds daunting.

  Read the article

• Combining pathfinding with global AI objectives

  - by V_Programmer

  I'm making a turn-based strategy game using Java and LibGDX. Now I want to code the AI. I haven't written the AI code yet. I've simply designed it. The AI will have two components, one focused in tactics and resource management (create troops, determine who have strategical advantage, detect important objectives, etc) and a individual component, focused in assign the work to each unit, examine its possibilites and move the unit. Now I'm facing an important problem. The map where the action take place is a grid-based map. Each terrain has different movement cost. I read about pathfinding and I think A* is a very good option to determine a good route between two points. However, imagine I have an unit with movement = 5 (i.e, it can move 5 tiles of movement cost = 1). My tactical AI has found an objective at a distance d = 20 tiles (Manhattan distance) from my unit. My problem is the following: the unit won't be able to reach the objective in one turn. So the AI will have to store a list of position and execute them in various turns. I don't know how to solve this. PS. In my unit code, I have a list called "selectionMarks" which stores all the possible places where the unit can go in this turn. This places are calculed recursively using a "getSelectionMarks" function. Any help is appreciated :D

  Read the article

• Exchange 2010 Discovery Search Fails

  - by ITGuy24

  When ever I run an Exchange 2010 SP1 Discovery Search I get the following error: "Search failed as the results link to the target mailbox '[email protected]' couldn't be generated." I have checked to ensure the discovery mailbox is enabled I created a new Discovery mailbox. I get the same error with both Mailboxes. The user account I am using to run the search is a member of the "Discovery Management" security group. I get the same error whether I use the Shell or the ECP to run the search

  Read the article

• How Interlinking Your Posts Helps With Search Engine Optimization

  We all know that interlinking your posts helps your search engine ranking. Find out why.

  Read the article

• Google Analytics - Traffic Source - Search engine - (Not Provided)

  - by Dharmavir

  I am using Google Analytics, now here when I go to "Traffic Source Overview" under that it shows Keyword as "(Not provided)" which is almost 40% of my traffic source. Now more than 90% of search engine traffic is from Google and still out of that for more than 40% of keywords are "(Not provided)". Can anyone explain me what is going wrong here or how can I get that data? Because that comes as 1st option and is biggest keyword in the list. Will that be some crawler or secure google search?

  Read the article

• Check Out The New Search Helper For 'Adpatch' Utility

  - by LuciaC

  Have you seen the new Search Helper for problems and documentation relating to the 'adpatch' utility?   Check out the details in Doc ID 1502809.1. The Search Helper presents you with a wizard-like interface where you select the task you are attempting, the symptoms or errors you are hitting and arrives at a targeted list of solutions based on that information.  This is a simple and quick way of searching for any issues that you are having with adpatch. How to use this tool: 1. Select the intent or task that is failing. 2. A list of known symptoms (or facts) associated with the task will display under the section "In addition the following occurs". 3. As you select symptoms the solutions section will populate (and change as you select or deselect).

  Read the article

• Search for the Content You Don't Want to Miss

  - by Oracle OpenWorld Blog Team

  by Meg Ehman The Oracle OpenWorld 2013 content catalog is now live—more accessible than ever with all you need to know about sessions, speakers, demos, labs, user groups, exhibitors, and more. This year, for the first time, you’ll find all Oracle conference content in a single catalog. You can browse the entire catalog at one time, or filter your search by conference, product, session, speaker, or other keywords.  If you find a session you think friends or colleagues would like to attend, share it with them through Facebook or Twitter. Start checking out Oracle OpenWorld content now to make sure you know how to plan your week at the conference. Then when Schedule Builder goes live in early August you’ll be ready to sign up quickly to have the best chance for getting into all of the great sessions you want to.   Search Content Catalog NowLearn More about Oracle OpenWorldRegister for Oracle OpenWorld

  Read the article

< Previous Page | 88 89 90 91 92 93 94 95 96 97 98 99  | Next Page >